Computing answers with model elimination
- 28 February 1997
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 90 (1-2) , 135-176
- https://doi.org/10.1016/s0004-3702(96)00042-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Model elimination without contrapositives and its application to PTTPJournal of Automated Reasoning, 1994
- Controlled integration of the cut rule into connection tableau calculiJournal of Automated Reasoning, 1994
- OTTER 3.0 reference manual and guidePublished by Office of Scientific and Technical Information (OSTI) ,1994
- Consolution as a Framework for Comparing CalculiJournal of Symbolic Computation, 1993
- Removing redundancy from a clauseArtificial Intelligence, 1993
- SETHEO: A high-performance theorem proverJournal of Automated Reasoning, 1992
- Near-Horn Prolog and beyondJournal of Automated Reasoning, 1991
- Non-Horn clause logic programming without contrapositivesJournal of Automated Reasoning, 1988
- Predicate logic hacker tricksJournal of Automated Reasoning, 1985
- Mechanical Theorem-Proving by Model EliminationJournal of the ACM, 1968