SATIRE: a new incremental satisfiability engine
Proceedings of the 38th annual Design Automation Conference
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
On Solving Stack-Based Incremental Satisfiability Problems
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Stochastic local search for incremental SAT
International Journal of Knowledge-based and Intelligent Engineering Systems
A new hybrid solution to boost SAT solver performance
Proceedings of the conference on Design, automation and test in Europe
Incremental compilation-to-SAT procedures
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The satisfiability problem is to check whether a set of clauses in propositional logic is satisfiable. If it is satisfiable, the incremental satisfiability problem is then to check whether satisfiability remains given additional clauses. This paper deals with an incremental branch-and-bound method which solves exactly both problems. This method includes flexible Lagrangean relaxations, metaheuristics, and judicious jumping back. This leads to an efficient implementation which compares favorably with the classical Davis-Putnam-Loveland procedure and its incremental version designed by Hooker. Numerous computational results are detailed.