A lattice-based representation of independence relations for efficient closure computation

DOI10.1016/j.ijar.2020.08.002zbMath1490.68221OpenAlexW3082358104MaRDI QIDQ2206476

Linda C. van der Gaag, Marco Baioletti, Janneke H. Bolt

Publication date: 22 October 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2020.08.002

zbMATH Keywords

representationindependence relationsalgorithm engineeringfast-closure computationlattice-based partitioning

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional independence structure and its closure: inferential rules and algorithms
• Semigraphoids and structures of probabilistic conditional independence
• Concise representations and construction algorithms for semi-graphoid independency models

This page was built for publication: A lattice-based representation of independence relations for efficient closure computation