Succinct representations of graphs
Information and Control
Short proofs for tricky formulas
Acta Informatica
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
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
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The hazards of fancy backtracking
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Logic-based 0-1 constraint programming
Logic-based 0-1 constraint programming
Automorphism groups, isomorphism, reconstruction
Handbook of combinatorics (vol. 2)
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Hard problems for CSP Algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Propositional proof complexity: past, present, and future
Current trends in theoretical computer science
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Otter - The CADE-13 Competition Incarnations
Journal of Automated Reasoning
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Backtrack Searching in the Presence of Symmetry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Resolution with Generalized Symmetry Rules
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Propositional Satisfiability in Answer-Set Programming
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
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
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Counting bottlenecks to show monotone P ? NP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Lifted search engines for satisfiability
Lifted search engines for satisfiability
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Exploiting symmetry in lifted CSPs
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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
Solving linear pseudo-Boolean constraint problems with local search
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
Tools for modeling and solving search problems
AI Communications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
An Smodels system with limited lookahead computation
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Constraint processing in relational database systems: from theory to implementation
Proceedings of the 2010 ACM Symposium on Applied Computing
Logic as energy: a SAT-based approach
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
Mapping and combining combinatorial problems into energy landscapes via pseudo-boolean constraints
BVAI'05 Proceedings of the First international conference on Brain, Vision, and Artificial Intelligence
Hi-index | 0.00 |
This is the first 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 is a survey of the work underlying ZAP, and discusses previous attempts to improve the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting the structure of the problem being solved. We examine existing ideas including extensions of the Boolean language to allow cardinality constraints, pseudo-Boolean representations, symmetry, and a limited form of quantification. While this paper is intended as a survey, our research results are contained in the two subsequent articles, with the theoretical structure of ZAP described in the second paper in this series, and ZAP's implementation described in the third.