A lattice-based representation of independence relations for efficient closure computation (Q2206476): Difference between revisions

@@ Property / DOI @@
-.1016/j.ijar.2020.08.002
@@ Property / DOI: 10.1016/j.ijar.2020.08.002 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ijar.2020.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W3082358104
@@ Property / OpenAlex ID: W3082358104 / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional independence structure and its closure: inferential rules and algorithms
+Normal rank
@@ Property / cites work @@
+Q5331549
@@ Property / cites work: Q5331549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4195750
@@ Property / cites work: Q4195750 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3655273
@@ Property / cites work: Q3655273 / rank @@
+Normal rank
@@ Property / cites work @@
+Concise representations and construction algorithms for semi-graphoid independency models
+Normal rank
@@ Property / cites work @@
+Q4035210
@@ Property / cites work: Q4035210 / rank @@
+Normal rank
@@ Property / cites work @@
+Semigraphoids and structures of probabilistic conditional independence
+Normal rank
@@ Property / cites work @@
+Q4663408
@@ Property / cites work: Q4663408 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IJAR.2020.08.002
@@ Property / DOI: 10.1016/J.IJAR.2020.08.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2206476