Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Probing-Based Preprocessing Techniques for Propositional Satisfiability
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers
Annals of Mathematics and Artificial Intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Recent years have seen remarkable progress in propositional satisfiability (SAT). Despite the worst-case exponential run time of all known algorithms, SAT solvers can currently be used to solve hard benchmark problems.This PhD dissertation contributes to a better understanding of the techniques, the algorithms and the applications of propositional satisfiability. First, we introduce efficient lazy data structures that, though unable to determine exactly the dynamic size of a clause, are quite accurate at predicting the number of unassigned literals in a clause. In addition, we suggest the use of probing-based preprocessing techniques for manipulating propositional formulas. Furthermore, unrestricted backtracking is proposed as an algorithm that combines the advantages of local search and backtrack search. Finally, we relate hardness with hidden structure in unsatisfiable random 3-SAT formulas, where hardness is measured by the search effort and hidden structure is measured by unsatisfiable cores and strong backdoors.