A satisfiability tester for non-clausal propositional calculus
- 1 October 1988
- journal article
- Published by Elsevier in Information and Computation
- Vol. 79 (1) , 1-21
- https://doi.org/10.1016/0890-5401(88)90014-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960