## PROTEIN: A PROver with a Theory Extension Interface (1994)

### Cached

### Download Links

- [users.rsise.anu.edu.au]
- [rsise.anu.edu.au]
- [users.cecs.anu.edu.au]
- DBLP

### Other Repositories/Bibliography

Venue: | AUTOMATED DEDUCTION -- CADE-12, VOLUME 814 OF LNAI |

Citations: | 40 - 10 self |

### BibTeX

@INPROCEEDINGS{Baumgartner94protein:a,

author = {Peter Baumgartner and Ulrich Furbach},

title = {PROTEIN: A PROver with a Theory Extension Interface},

booktitle = {AUTOMATED DEDUCTION -- CADE-12, VOLUME 814 OF LNAI},

year = {1994},

pages = {769--773},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements known for model elimination, PROTEIN also offers a variant of model elimination for case-based reasoning and which does not need contrapositives.

### Citations

121 | Automated Deduction by Theory Resolution
- Stickel
- 1985
(Show Context)
Citation Context ...ery easily implemented within a PTTP-framework, and, second, the better informed search due to additional ancestor literals. Theory reasoning was introduced byM. Stickel within the resolution calculus=-=[Sti85]-=-; for model elimination it is defined an investigated in [Bau92]. Technically, theory reasoning means to relieve a calculus from explicit reasoning in some domain (e.g. equality, partial orders, taxon... |

100 | The TPTP problem library
- Sutcliffe, Suttner, et al.
- 1994
(Show Context)
Citation Context ... sufficiently small and need not be mentioned. In case linearizing completion would yield an infinite inference system for background 4 Entries such as MSC/MSC006-1 refer to the respective TPTP-names =-=[SSY94]-=-. All examples were drawn from that problem library without modification --- only the theory part had to be selected by hand. Example ME Restart-ME TME Restart-TME Setheo Non-obvious 0.3 2.7 1.6 1.1 (... |

100 | A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- Stickel
- 1988
(Show Context)
Citation Context ...es not need contrapositives. PROTEIN is a complete theorem prover for first order clause logic. It is characterized by the following features: -- PROTEIN is based on the PTTP implementation technique =-=[Sti88]-=- for model elimination [Lov69]. -- PROTEIN offers alternative inference rules for case analysis [Lov87, BF93]. In this setting no contrapositives are needed, and hence the system is well suited as an ... |

31 | Non-Horn clause logic programming without contrapositives - Plaisted - 1988 |

22 | 1994], `Model Elimination without Contrapositives and its Application to PTTP
- Baumgartner, Furbach
(Show Context)
Citation Context ...he case-analysis style of reasoning came up with various (non-theory) calculi which do not need all contrapositives ([Lov87, Pla88]). A detailed comparison of those calculi can be found in [RL92]. In =-=[BF93]-=- we have made a small change to model elimination which also avoids contrapositives and has some distinguished features. This modification of model elimination is called restart model elimination; its... |

22 |
Challenge problems in elementary calculus
- Bledsoe
- 1990
(Show Context)
Citation Context ...n the Graph example a graph with a transitive and symmetric reachability relation is traversed. The Ederexamples are described in [LSBB92]. The Bledsoe examples are the first two of the five given in =-=[Ble90]-=-. The example referred to by x 6= 0 ! x 2 ? 0 is to prove this theorem (x is universally quantified) from calculus. Case analysis is carried out according to the axiom X ? 0sX = 0s\GammaX ? 0. For the... |

19 | Near-Horn Prolog - Loveland - 1987 |

17 | A model elimination calculus with built-in theories
- Baumgartner
- 1992
(Show Context)
Citation Context ... better informed search due to additional ancestor literals. Theory reasoning was introduced byM. Stickel within the resolution calculus[Sti85]; for model elimination it is defined an investigated in =-=[Bau92]-=-. Technically, theory reasoning means to relieve a calculus from explicit reasoning in some domain (e.g. equality, partial orders, taxonomic reasoning) by taking apart the domain knowledge and treatin... |

16 | Model Elimination without Contrapositives - Baumgartner, Furbach - 1994 |

13 |
A Comparison of Three Prolog Extensions
- Reed, Loveland
- 1992
(Show Context)
Citation Context ...duktion". The case-analysis style of reasoning came up with various (non-theory) calculi which do not need all contrapositives ([Lov87, Pla88]). A detailed comparison of those calculi can be foun=-=d in [RL92]-=-. In [BF93] we have made a small change to model elimination which also avoids contrapositives and has some distinguished features. This modification of model elimination is called restart model elimi... |

8 | Refinements of Theory Model Elimination and a Variant without Contrapositives
- Baumgartner
- 1994
(Show Context)
Citation Context ...ckground" reasoner for theory reasoning. See [BFP92] for an overview. Fortunately, the calculus' features "case-analysis reasoning" and "theory reasoning" are fairly compatibl=-=e with model elimination [Bau94]. In [BF93-=-, BF94] we have shown that "case analysis" -- in the non-theory setting -- requires only a small change to the calculus. PROTEIN is the respective implementation for theory reasoning. Furthe... |

5 |
A Unified Approach to Theory Reasoning. Forschungsbericht 15/92
- Baumgartner, Furbach, et al.
- 1992
(Show Context)
Citation Context ... knowledge and treating it by special inference rules. In an implementation, this results in a universal "foreground" reasoner that calls a specialized "background" reasoner for th=-=eory reasoning. See [BFP92] for an overview. Fortuna-=-tely, the calculus' features "case-analysis reasoning" and "theory reasoning" are fairly compatible with model elimination [Bau94]. In [BF93, BF94] we have shown that "case an... |

4 |
SETHEO: A High-Performace Theorem Prover
- Letz, Schumann, et al.
- 1992
(Show Context)
Citation Context ...odel elimination prover. Table 1 contains the runtime results (in seconds), obtained on a SPARC 10/40. The first four columns refer to different versions of PROTEIN. Column 5 contains data for Setheo =-=[LSBB92]-=- in its latest version (Version 3.0). PROTEIN was run in default mode, except where indicated in Table 1. In default mode it includes the regularity restriction and the ground-reduction refinement. Se... |

3 |
Linear Completion: Combining the Linear and the Unit-Resulting Restrictions
- Baumgartner
- 1993
(Show Context)
Citation Context ...exactly one literal. As a possible application we think of reasoning by examples [KMS93]. The implementation of partial theory reasoning is currently tailored for the method of linearizing completion =-=[Bau93]. Lineariz-=-ing completion is a saturation technique that transforms a given Horn clause set T into a "completed" set, which admits (in resolution terminology) both linear and unit-resulting proofs for ... |

3 |
A Simplified Version for the Model Elimination Theorem Proving Procedure
- Loveland
- 1969
(Show Context)
Citation Context ...ROTEIN is a complete theorem prover for first order clause logic. It is characterized by the following features: -- PROTEIN is based on the PTTP implementation technique [Sti88] for model elimination =-=[Lov69]-=-. -- PROTEIN offers alternative inference rules for case analysis [Lov87, BF93]. In this setting no contrapositives are needed, and hence the system is well suited as an interpreter for disjunctive lo... |

2 |
org Siekmann. Reasoning with Assertions and Examples
- Kerber, Melis, et al.
- 1993
(Show Context)
Citation Context ...trict ordering classification we have here a total theory-extension step with a theory-complementary set consisting of exactly one literal. As a possible application we think of reasoning by examples =-=[KMS93]-=-. The implementation of partial theory reasoning is currently tailored for the method of linearizing completion [Bau93]. Linearizing completion is a saturation technique that transforms a given Horn c... |

1 |
A Prolog TechnologyTheorem Prover
- Stickel
- 1990
(Show Context)
Citation Context ...er to handle the non-Horn case. By this technique the WAM-technology and other benefits of optimizing Prolog compilers are accessible to theorem proving. A disadvantage of PTTP, according to Stickel (=-=[Sti90]), is that &quo-=-t;the high inference rate can be overwhelmed by its exponential search space" and therefore PTTP might be well suited for easy problems whereas "it is unsuitable for many difficult theorems ... |