Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/ios-press/restricting-backtracking-in-connection-calculi-joptFyRksn
References (46)
-
Konstantin Korovin (2008)
iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description) -
J. Otten, C. Kreitz (1996)
T-String Unification: Unifying Prefixes in Non-classical Proof Methods -
R. Letz, Gernot Stenz (2001)
Model Elimination and Connection Tableau Procedures -
R. Letz, K. Mayr, C. Goller (1994)
Controlled integration of the cut rule into connection tableau calculiJournal of Automated Reasoning, 13
-
R. Letz, J. Schumann, Stefan Bayerl, W. Bibel (1992)
SETHEO: A high-performance theorem proverJournal of Automated Reasoning, 8
-
W. McCune (1990)
Otter 2.0 -
Thomas Raths, J. Otten (2008)
randoCoP: Randomizing the Proof Search Order in the Connection Calculus -
A. Riazanov, A. Voronkov (2002)
The design and implementation of VAMPIREAI Commun., 15
-
Bernhard Beckert, J. Posegga (1994)
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract) -
Reiner Hähnle (2001)
Tableaux and Related Methods -
C. Kreitz, J. Otten (1999)
Connection-based Theorem Proving in Classical and Non-classical LogicsJ. Univers. Comput. Sci., 5
-
D. Loveland (1968)
Mechanical Theorem-Proving by Model EliminationJ. ACM, 15
-
Thomas Raths, J. Otten, C. Kreitz (2007)
The ILTP Problem Library for Intuitionistic LogicJournal of Automated Reasoning, 38
-
G. Sutcliffe, C. Suttner (1994)
The TPTP Problem LibraryJournal of Automated Reasoning, 21
-
S. Schulz (2002)
E - a brainiac theorem proverAI Commun., 15
-
D. Plaisted, Steven Greenbaum (1986)
A Structure-Preserving Clause Form TranslationJ. Symb. Comput., 2
-
A. Martelli, U. Montanari (1982)
An Efficient Unification AlgorithmACM Trans. Program. Lang. Syst., 4
-
G. Sutcliffe, C. Suttner (2001)
Evaluating general purpose automated theorem proving systemsArtif. Intell., 131
-
W. Clocksin, C. Mellish (1987)
Programming in Prolog -
(2005)
Release of Prover9 Mile high conference on quasigroups, loops and nonassociative systems -
R. Statman (1979)
Intuitionistic Propositional Logic is Polynomial-Space CompleteTheor. Comput. Sci., 9
-
M. Fitting (1990)
First-Order Logic and Automated Theorem Proving -
Reiner Hähnle, P. Schmitt (1994)
The liberalized δ-rule in free variable semantic tableauxJournal of Automated Reasoning, 13
-
J. Otten (2008)
leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) -
Christoph Weidenbach, R. Schmidt, T. Hillenbrand, R. Rusev, Dalibor Topic (2007)
System Description: SpassVersion 3.0 -
M. Stickel (1986)
A prolog technology theorem prover: Implementation by an extended prolog compilerJournal of Automated Reasoning, 4
-
M. Stickel (1990)
A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog -
Andreas Nonnengart, Christoph Weidenbach (2001)
Computing Small Clause Normal Forms -
J. Otten, C. Kreitz (1996)
A Uniform Proof Procedure for Classical and Non-Classical Logics -
(1985)
What Is Automated Theorem Proving?J. Autom. Reason., 1
-
J. Robinson (1965)
A Machine-Oriented Logic Based on the Resolution PrincipleJ. ACM, 12
-
Bernhard Beckert
Leant a P: Lean Tableau-based Theorem Proving -
Shie-Jue Lee, D. Plaisted (1992)
Eliminating duplication with the hyper-linking strategyJournal of Automated Reasoning, 9
-
W. Bibel (1983)
Matings in matricesCommun. ACM, 26
-
W. McCune (1994)
OTTER 3.0 Reference Manual and Guide -
Jens Otten, Wolfgang Bibel (2003)
leanCoP: lean connection-based theorem provingJ. Symb. Comput., 36
-
L. Wallen (1990)
Automated deduction in nonclassical logics -
G. Gentzen (1935)
Untersuchungen über das logische Schließen. IMathematische Zeitschrift, 39
-
J. Otten (1997)
ileanTAP: An Intuitionistic Theorem Prover -
E. Eder (1992)
Relative complexities of first order calculi -
G. Sutcliffe (2009)
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4AI Commun., 22
-
R. Letz (2000)
Properties and Relations of Tableau and Connection Calculi -
J. Otten (2005)
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic -
Peter Baumgartner, N. Eisinger, U. Furbach (1999)
A Confluent Connection Calculus -
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
-
A. Waaler (2001)
Connections in Nonclassical Logics
- Publisher
- IOS Press
- Copyright
- Copyright © 2010 by IOS Press, Inc
- ISSN
- 0921-7126
- eISSN
- 1875-8452
- DOI
- 10.3233/AIC-2010-0464
- Publisher site
- See Article on Publisher Site
Abstract
Connection calculi benefit from a goal-oriented proof search, but are in general not proof confluent. A substantial amount of backtracking is required, which significantly affects the time complexity of the proof search. This paper presents a simple strategy for effectively restricting backtracking in connection calculi. In combination with a few basic techniques it provides the basis for a refined connection calculus. The paper also describes how this calculus can be implemented directly by a few lines of Prolog code. This very compact program is the core of an enhanced version of the automated theorem prover leanCoP. The performance of leanCoP is compared with other lean theorem provers, connection provers, and state-of-the-art theorem provers. The results show that restricted backtracking is a successful technique when performing proof search in connection calculi.
Journal
AI Communications – IOS Press
Published: Jan 1, 2010