The intractability of resolution
Open Access
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 39, 297-308
- https://doi.org/10.1016/0304-3975(85)90144-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A note on regular resolutionComputing, 1981
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- Corrections for "On the lengths of proofs in the propositional calculus preliminary version"ACM SIGACT News, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960