Information loss in knowledge compilation: a comparison of Boolean envelopes

DOI10.1016/J.ARTINT.2010.03.003zbMATH Open1206.68291DBLPjournals/ai/SchachteSWH10OpenAlexW2022883231WikidataQ57665008 ScholiaQ57665008MaRDI QIDQ991010FDOQ991010

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

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

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)

Cites Work

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

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)