Journal of the ACM (JACM)
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
A hierarchy of tractable satisfiability problems
Information Processing Letters
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On finding solutions for extended Horn formulas
Information Processing Letters
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics
ZRES: The Old Davis-Putman Procedure Meets ZBDD
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
The Complexity of Resolution Refinements
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Universal Booleanization of Constraint Models
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A new clause learning scheme for efficient unsatisfiability proofs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
A tractable class of abduction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Encodings of the SEQUENCE constraint
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A new algorithm for computing theory prime implicates compilations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the power of clause-learning SAT solvers as resolution engines
Artificial Intelligence
The Depth of Resolution Proofs
Studia Logica
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Knowledge compilation with empowerment
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 0.00 |
Knowledge compilation is a process of adding more information to a knowledge base in order to make it easier to deduce facts from the compiled base than from the original one. One type of knowledge compilation occurs when the knowledge in question is represented by a Boolean formula in conjunctive normal form (CNF). The goal of knowledge compilation in this case is to add clauses to the input CNF until a logically equivalent propagation complete CNF is obtained. A CNF is called propagation complete if after any partial substitution of truth values all logically entailed literals can be inferred from the resulting CNF formula by unit propagation. The key to this type of knowledge compilation is the ability to generate so-called empowering clauses. A clause is empowering for a CNF if it is an implicate and for some partial substitution of truth values it enlarges the set of entailed literals inferable by unit propagation. In this paper we study several complexity issues related to empowering implicates, propagation completeness, and its relation to resolution proofs. We show several results: (a) given a CNF and a clause it is co-NP complete to decide whether the clause is an empowering implicate of the CNF, (b) given a CNF it is NP-complete to decide whether there exists an empowering implicate for it and thus it is co-NP complete to decide whether a CNF is propagation complete, and (c) there exist CNFs to which an exponential number of clauses must be added to make them propagation complete.