Analysis of Random Noise and Random Walk Algorithms
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Efficient SAT-based Boolean matching for FPGA technology mapping
Proceedings of the 43rd annual Design Automation Conference
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Planning as satisfiability: parallel plans and algorithms for plan search
Artificial Intelligence
Advances in local search for satisfiability
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
From spin glasses to hard satisfiable formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Feature models, grammars, and propositional formulas
SPLC'05 Proceedings of the 9th international conference on Software Product Lines
Solving difficult instances of Boolean satisfiability in the presence of symmetry
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fault diagnosis and logic debugging using Boolean satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Zero-One designs produce small hard SAT instances
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The satisfiability problem is known to be NP-Complete; therefore, there should be relatively small problem instances that take a very long time to solve. However, most of the smaller benchmarks that were once thought challenging, especially the satisfiable ones, can be processed quickly by modern SAT-solvers. We describe and make available a generator that produces both unsatisfiable and, more significantly, satisfiable formulae that take longer to solve than any others known. At the two most recent international SAT Competitions, the smallest unsolved benchmarks were created by this generator. We analyze the results of all solvers in the most recent competition when applied to these benchmarks and also present our own more focused experiments.