Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
CNF satisfiability test by counting and polynomial average time
SIAM Journal on Computing
Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
| Hi-index | 0.00 |
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.