On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Optimizing the clausal normal form transformation
Journal of Automated Reasoning
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
An empirical evaluation of knowledge compilation by theory approximation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Two-level logic minimization: an overview
Integration, the VLSI Journal
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Proceedings of the 10th International Conference on Automated Deduction
A New Algorithm for Generating Prime Implicants
IEEE Transactions on Computers
A logically complete reasoning maintenance system based on a logical constraint solver
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Constraints
A Logic for Anytime Deduction and Anytime Compilation
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Propositional Lower Bounds: Generalization and Algorithms
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Knowledge Compilation Using the Extension Rule
Journal of Automated Reasoning
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
A survey on knowledge compilation
AI Communications
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A new algorithm for computing theory prime implicates compilations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We show that many "critically constrained" Random 3SAT knowledge bases (KBs) can be compiled into disjunctive normal form easily by using a variant of the "Davis-Putnam" proof procedure. From these compiled KBs we can answer all queries about entailment of conjunctive normal formulas, also easily -- compared to a "brute-force" approach to approximate knowledge compilation into unit clauses for the same KBs. We exploit this fact to develop an aggressive hybrid approach which attempts to compile a KB exactly until a given resource limit is reached, then falls back to approximate compilation into unit clauses. The resulting approach handles all of the critically constrained Random 3SAT KBs with average savings of an order of magnitude over the brute-force approach.