On-line algorithms for polynomially solvable satisfiability problems
Journal of Logic Programming
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
CP '95 Proceedings of the First 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
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
The Davis and Putnam (D&P) scheme has been intensively studied during this last decade. Nowadays, its good empirical performances are well-known. Here, we deal with its theoretical side which has been relatively less studied until now. Thus, we propose a strictely linear D&P algorithm for the most well known tractable classes: Horn-SAT and 2-SAT. Specifically, the strictely linearity of our proposed D&P algorithm improves significantly the previous existing complexities that were quadratic for Horn-SAT and even exponential for 2-SAT. As a consequence, the D&P algorithm designed to deal with the general SAT problem runs as fast (in terms of complexity) as the specialised algorithms designed to work exclusively with a specific tractable SAT subclass.