article

The SAT2002 competition

Authors:

Laurent Simon,

Daniel Berre,

Edward A. HirschAuthors Info & Claims

Annals of Mathematics and Artificial Intelligence, Volume 43, Issue 1-4

Pages 307 - 342

https://doi.org/10.1007/s10472-005-0424-6

Published: 01 January 2005 Publication History

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.

Cited By

View all

Simon NLevy PSarne D(2024)Costly information providing in binary contestsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-024-09953-792:5(1353-1375)Online publication date: 27-Jul-2024
https://dl.acm.org/doi/10.1007/s10472-024-09953-7
Bryant RHeule M(2023)Generating Extended Resolution Proofs with a BDD-Based SAT SolverACM Transactions on Computational Logic10.1145/359529524:4(1-28)Online publication date: 25-Jul-2023
https://dl.acm.org/doi/10.1145/3595295
Balyo THeule MJärvisalo MSingh SMarkovitch S(2017)SAT competition 2016Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3297863.3298003(5061-5063)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3297863.3298003
Show More Cited By

Recommendations

The SAT2002 Competition

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 ...
A parsimony tree for the SAT2002 competition

Twenty of the programs (solvers) submitted to the SAT 2002 Contest had no disqualifying errors. These solvers were run on 2023 satisfiability problems of varying hardnesses. Each solver was judged by which problems it could solve within the allowed time ...
A Parsimony Tree for the SAT2002 Competition

Twenty of the programs (solvers) submitted to the SAT 2002 Contest had no disqualifying errors. These solvers were run on 2023 satisfiability problems of varying hardnesses. Each solver was judged by which problems it could solve within the allowed time ...

Comments

Information & Contributors

Information

Published In

cover image Annals of Mathematics and Artificial Intelligence

Annals of Mathematics and Artificial Intelligence Volume 43, Issue 1-4

January 2005

721 pages

ISSN:1012-2443

Issue’s Table of Contents

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 January 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Simon NLevy PSarne D(2024)Costly information providing in binary contestsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-024-09953-792:5(1353-1375)Online publication date: 27-Jul-2024
https://dl.acm.org/doi/10.1007/s10472-024-09953-7
Bryant RHeule M(2023)Generating Extended Resolution Proofs with a BDD-Based SAT SolverACM Transactions on Computational Logic10.1145/359529524:4(1-28)Online publication date: 25-Jul-2023
https://dl.acm.org/doi/10.1145/3595295
Balyo THeule MJärvisalo MSingh SMarkovitch S(2017)SAT competition 2016Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3297863.3298003(5061-5063)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3297863.3298003
Shankar N(2009)Automated deduction for verificationACM Computing Surveys10.1145/1592434.159243741:4(1-56)Online publication date: 9-Oct-2009
https://dl.acm.org/doi/10.1145/1592434.1592437
Alekhnovich MHirsch EItsykson D(2005)Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable FormulasJournal of Automated Reasoning10.1007/s10817-005-9006-x35:1-3(51-72)Online publication date: 1-Oct-2005
https://dl.acm.org/doi/10.1007/s10817-005-9006-x

Abstract

Cited By

Recommendations