Information loss in knowledge compilation: a comparison of Boolean envelopes

DOI10.1016/j.artint.2010.03.003zbMath1206.68291OpenAlexW2022883231WikidataQ57665008 ScholiaQ57665008MaRDI QIDQ991010

Leigh Whiting, Harald Søndergaard, Kevin Henshall, Peter Schachte

Publication date: 2 September 2010

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.03.003

zbMATH Keywords

knowledge basesBoolean approximationco-clonestractable inference

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (1)

SAT-Based Horn Least Upper Bounds

Cites Work

• Structure identification in relational data
• First order LUB approximations: characterization and algorithms
• Graph-Based Algorithms for Boolean Function Manipulation
• Knowledge compilation and theory approximation
• The complexity of satisfiability problems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Information loss in knowledge compilation: a comparison of Boolean envelopes