Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Minimizing the number of clauses by renaming
CADE-10 Proceedings of the tenth international conference on Automated deduction
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Applying GSAT to non-clausal formulas
Journal of Artificial Intelligence Research
Dependent and Independent Variables in Propositional Satisfiability
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Satisfiability Checking Using Boolean Expression Diagrams
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Improving the Encoding of LTL Model Checking into SAT
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Integrating BDD-Based and SAT-Based Symbolic Model Checking
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Using a theorem prover for reasoning on constraint problems
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
On finding an inference-proof complete database for controlled query evaluation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Programming for modular reconfigurable robots
Programming and Computing Software
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Understanding script-based stories using commonsense reasoning
Cognitive Systems Research
| Hi-index | 0.00 |
Traditionally, the satisfiability problem for propositional logics deals with formulas in Conjunctive Normal Form (CNF). A typical way to deal with non-CNF formulas requires (i) converting them into CNF, and (ii) applying solvers usually based on the Davis-Putnam (DP) procedure. A well known problem of this solution is that the CNF conversion may introduce many new variables, thus greatly widening the space of assignments in which the DP procedure has to search in order to find solutions. In this paper we present two variants of the DP procedure which overcome the problem outlined above. The idea underlying these variants is that splitting should occur only for the variables in the original formula. The CNF conversion methods employed ensure their correctness and completeness. As a consequence, we get two decision procedures for non-CNF formulas (i) which can exploit all the present and future sophisticated technology of current DP implementations, and (ii) whose space of assignments they have to search in, is limited in size by the number of variables in the original input formula. In [11], it is showed that limiting the splitting step to a subset of the set of variables (the truth values of the others being consequentially determined) can lead to significant speeds up.