Searching for "Algorithms for Testing the Satisfiability of Propositional Formulae." – sorted by Relevance.
-
Satisfiability Testing with More Reasoning and Less Guessing
- for testing satisfiability of propositional formulas in conjunctive normal form (CNF) is described. It applies
- Cited by 45 (10 self) – Add To MetaCart
-
Constructing Conditional Plans by a Theorem-Prover
- to formulae in the propositional logic, and then find plans by an algorithm that tests the satisfiability
- Cited by 111 (6 self) – Add To MetaCart
-
Simplification and Backjumping in Modal Tableau
- the satisfiability of propositional formulae based on the tableau rules of Figure 1 for the propositional connectives
- Cited by 8 (4 self) – Add To MetaCart

