Information loss in knowledge compilation: a comparison of Boolean envelopes

DOI10.1016/J.ARTINT.2010.03.003MaRDI QIDQ991010zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

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

Recommendations

• Knowledge compilation and theory approximation
• scientific article; zbMATH DE number 2086980
• Semantical and computational aspects of Horn approximations
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• scientific article; zbMATH DE number 1149451

Cites work

• scientific article; zbMATH DE number 1354130 (Why is no real title available?)
• scientific article; zbMATH DE number 1061261 (Why is no real title available?)
• scientific article; zbMATH DE number 2086980 (Why is no real title available?)
• scientific article; zbMATH DE number 6292613 (Why is no real title available?)
• scientific article; zbMATH DE number 3185026 (Why is no real title available?)
• First order LUB approximations: characterization and algorithms
• Graph-Based Algorithms for Boolean Function Manipulation
• Knowledge compilation and theory approximation
• Structure identification in relational data
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The complexity of satisfiability problems

Cited in

(1)

• SAT-Based Horn Least Upper Bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991010)