Algorithms for testing the satisfiability of propositional formulae
- 31 July 1989
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 7 (1) , 45-61
- https://doi.org/10.1016/0743-1066(89)90009-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the complexity of the maximum satisfiability problem for horn formulasInformation Processing Letters, 1987
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Solving Satisfiability with Less SearchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960