Present and Future of Practical SAT Solving

Authors:
Oliver Kullmann
Affiliations:
Computer Science Department, Swansea University, Swansea, UK SA2 8PP
Venue:
Complexity of Constraints
Year:
2008

Citing 26
Cited 2

A hierarchy of tractable satisfiability problems

Information Processing Letters
Search Problems in the Decision Tree Model

SIAM Journal on Discrete Mathematics
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
New methods for 3-SAT decision and worst-case analysis

Theoretical Computer Science
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
On a generalization of extended resolution

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A machine program for theorem-proving

Communications of the ACM
Investigations on autark assignments

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

Discrete Applied Mathematics - The renesse issue on satisfiability
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

Annals of Mathematics and Artificial Intelligence
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics
Mapping CSP into many-valued SAT

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Effective incorporation of double look-ahead procedures

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Towards a better understanding of the functionality of a conflict-driven SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Polynomial time SAT decision for complementation-invariant clause-sets,and sign-non-singular matrices

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Searching for autarkies to trim unsatisfiable clause sets

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Aligning CNF- and equivalence-reasoning

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Zchaff2004: an efficient SAT solver

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On subsumption removal and on-the-fly CNF simplification

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Categorisation of clauses in conjunctive normal forms: minimally unsatisfiable sub-clause-sets and the lean kernel

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency

Fundamenta Informaticae
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review current SAT solving, concentrating on the two paradigms of conflict-driven and look-ahead solvers, and with a view towards the unification of these two paradigms. A general "modern" scheme for DPLL algorithms is presented, which allows natural representations for "modern" solvers of these two types.