Optimizing proof search in model elimination
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 313-327
- https://doi.org/10.1007/3-540-61511-3_97
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- leanTAP: Lean tableau-based deductionJournal of Automated Reasoning, 1995
- Controlled integration of the cut rule into connection tableau calculiJournal of Automated Reasoning, 1994
- SETHEO: A high-performance theorem proverJournal of Automated Reasoning, 1992
- A sequent-style model elimination strategy and a positive refinementJournal of Automated Reasoning, 1990
- What is the inverse method?Journal of Automated Reasoning, 1989
- A prolog technology theorem prover: Implementation by an extended prolog compilerJournal of Automated Reasoning, 1988
- Obvious inferencesJournal of Automated Reasoning, 1987
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- “Memo” Functions and Machine LearningNature, 1968
- Mechanical Theorem-Proving by Model EliminationJournal of the ACM, 1968