Resolution vs. cutting plane solution of inference problems: Some computational experience
- 1 February 1988
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 7 (1) , 1-7
- https://doi.org/10.1016/0167-6377(88)90044-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Hard examples for resolutionJournal of the ACM, 1987
- The intractability of resolutionTheoretical Computer Science, 1985
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960