The SAT2002 Competition

Authors:
Laurent Simon;Daniel Le Berre;Edward A. Hirsch
Affiliations:
LRI, U.M.R. CNRS 8623, Université Paris-Sud, 91405 Orsay Cedex, France E-mail: simon@lri.fr;CRIL, F.R.E. CNRS 2499, Faculté Jean Perrin, Université d'Artois, Rue Jean Souvraz SP 18, 62300 Lens Cedex, France E-mail: leberre@cril.univ-artois.fr;Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023 St. Petersburg, Russia http://logic.pdmi.ras.ru/∼hirsch/
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2005

Citing 42
Cited 10

Hard examples for resolution

Journal of the ACM (JACM)
On the greedy algorithm for satisfiability

Information Processing Letters
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Noise strategies for improving local search

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
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A constraint-based approach to narrow search trees for satisfiability

Information Processing Letters
A machine program for theorem-proving

Communications of the ACM
Solving satisfiability problems using elliptic approximations - effective branching rules

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Evaluating general purpose automated theorem proving systems

Artificial Intelligence
Solving difficult SAT instances in the presence of symmetry

Proceedings of the 39th annual Design Automation Conference
Improving SAT using 2SAT

ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Lemma and cut strategies for propositional model elimination

Annals of Mathematics and Artificial Intelligence
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy

Journal of Automated Reasoning
SAT Local Search Algorithms: Worst-Case Study

Journal of Automated Reasoning
New Worst-Case Upper Bounds for SAT

Journal of Automated Reasoning
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems

Journal of Global Optimization
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Toward CAD-IP Reuse: A Web Bookshelf of Fundamental Algorithms

IEEE Design & Test
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical Computer Science
A Probabilistic 3-SAT Algorithm Further Improved

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Recovering and Exploiting Structural Knowledge from CNF Formulas

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th 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
Enhancing Davis Putnam with extended binary clause reasoning

Eighteenth national conference on Artificial intelligence
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
Multi-resolution on compressed sets of clauses

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination

Annals of Mathematics and Artificial Intelligence
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination

Annals of Mathematics and Artificial Intelligence
A SAT Approach to Query Optimization in Mediator Systems

Annals of Mathematics and Artificial Intelligence
Automatic SAT-compilation of planning problems

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
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
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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

The state of CASC

AI Communications
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas

Journal of Automated Reasoning
A View from the Engine Room: Computational Support for Symbolic Model Checking

25 Years of Model Checking
Present and Future of Practical SAT Solving

Complexity of Constraints
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Automated deduction for verification

ACM Computing Surveys (CSUR)
Effective incorporation of double look-ahead procedures

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
SampleSearch: Importance sampling in presence of determinism

Artificial Intelligence
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

SAT Competition 2002 held in March–May 2002 in conjunction with SAT 2002 (the Fifth International Symposium on the Theory and Applications of Satisfiability Testing). About 30 solvers and 2300 benchmarks took part in the competition, which required more than 2 CPU years to complete the evaluation. In this report, we give the results of the competition, try to interpret them, and give suggestions for future competitions.