Short proofs for tricky formulas
Acta Informatica
A compact representation for permutation groups
Journal of Algorithms
On the complexity of cutting-plane proofs
Discrete Applied Mathematics
Integer and combinatorial optimization
Integer and combinatorial optimization
Generalized resolution and cutting planes
Annals of Operations Research
Logic-based 0-1 constraint programming
Logic-based 0-1 constraint programming
Fast Management of Permutation Groups I
SIAM Journal on Computing
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
The Complexity of Resolution with Generalized Symmetry Rules
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
On the refutational completeness of signed binary resolution and hyperresolution
Fuzzy Sets and Systems
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
On the relation between answer set and sat procedures (or, between cmodels and smodels)
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Hi-index | 0.01 |
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAP's implementation and presents experimental performance results.