MathDB2 problems
- 0 votes0 replies0 views
Studený's two-antecedent completeness conjecture for discrete conditional independence
Studený's two-antecedent completeness conjecture. The semigraphoid axioms are complete for those inference rules of discrete conditional independence that have at most two antecede…
- 0 votes0 replies0 views
Pearl–Paz completeness conjecture for discrete conditional independence
Pearl–Paz completeness conjecture. The semigraphoid axioms are complete for the theory of discrete conditional-independence structures.