Abstract
The present paper presents algorithms for testing satisfiabily of clausalformulas in the propositional logic and the firs-order logic. The algorithmbased on the enumeration of solutions for testing the satisfiability ofpropositional formula, has already been given by K. Iwama, O. Dubois. Theoriginality in this paper is to combine this algorithm to other procedures,especially with the pure-literal literal and the one-literal rule, and also theone which consists in changing any formulas in formulas bounded. Thealgorithm based on the enumeration of the solution combined to theseprocedures is more efficient. The algorithm based on the concept ofresolutive derivation from Skolem normal form of formula α in first-order logic, has already been given. The idea in present's paper is tocombined to this algorithm to process of elimination of tautological clausesand process of elimination of subsumed clauses.
Similar content being viewed by others
References
Andrei, S. T. (1995). The Determinant of the Boolean Formulae. Anal. Univ. Bucharest XLIV: 83–92.
Iwama, K. (1989). CNF Satisfiability test by Counting and Polynominal Average Time. SIAM. J. Comp. 18(2): 385–391.
Chang, C. L. and Lee, R. C. (1973). Symbolic Logic and Mechanical Theorem Proving. Academic Press: New-York.
Dubois, O. (1991). Counting the Number of Solutions for Instance of Satisfiability. Theoretical Computer Science 81: 49–61.
Gallier, J. H. (1986). Logic for Computer Science. Foundations of Automatic Theorem Proving. Harper Row Publishers: New York.
Lloyd, J. W. (1987). Foundations of Logic Programming, Second, Extended Edition. Springer Verlag.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vlada, M. Algorithms for Testing Satisfiability Formulas. Artificial Intelligence Review 15, 153–163 (2001). https://doi.org/10.1023/A:1011006014945
Issue Date:
DOI: https://doi.org/10.1023/A:1011006014945