## System Description: Interface between Theorema And External Automated Deduction Systems (2001)

Venue: | In Linton and Sebastiani [175 |

Citations: | 3 - 0 self |

### BibTeX

@INPROCEEDINGS{Kutsia01systemdescription:,

author = {Temur Kutsia and Koji Nakagawa},

title = {System Description: Interface between Theorema And External Automated Deduction Systems},

booktitle = {In Linton and Sebastiani [175},

year = {2001}

}

### OpenURL

### Abstract

The interface between the Theorema system and external automated deduction systems is described. It provides a tool to access external provers within a Theorema session in the same way as \internal" Theorema provers. Currently 11 external systems are supported. The design of the interface allows combining external systems with each other as well as with \internal" Theorema provers.

### Citations

308 | Otter 3.0 reference manual and guide
- McCune
- 1994
(Show Context)
Citation Context ...tems) within Theorema session in the same way as \internal" Theorema provers. Currently, the following 11 external systems are supported: provers - Bliksem [19], EQP [17], E [21], Gandalf [23], O=-=tter [16]-=-, Scott [12], Setheo [15], Spass [24], Vampire [20], Waldmeister [4] and asnite model and counter-example searcher Mace [18]. The interface consists of two types of links - direct and indirect - from ... |

130 |
SETHEO:A high-performance theorem prover
- Letz, Schumann, et al.
- 1992
(Show Context)
Citation Context ...sion in the same way as \internal" Theorema provers. Currently, the following 11 external systems are supported: provers - Bliksem [19], EQP [17], E [21], Gandalf [23], Otter [16], Scott [12], Se=-=theo [15]-=-, Spass [24], Vampire [20], Waldmeister [4] and asnite model and counter-example searcher Mace [18]. The interface consists of two types of links - direct and indirect - from Theorema to an external s... |

50 | Theorems and algorithms: An interface between Isabelle and Maple
- Ballarin, Homann, et al.
- 1995
(Show Context)
Citation Context ...h combines Otter and the predicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. =-=[2]-=-, [3], [10], [11], [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide s... |

47 | Reasoning theories: Towards an architecture for open mechanized reasoning systems
- Giunchiglia, Pecchiari, et al.
(Show Context)
Citation Context ... Otter and the predicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], =-=[10]-=-, [11], [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide such a gener... |

42 | Integrating Computer Algebra Into Proof Planning
- Kerber, Kohlhase, et al.
- 1998
(Show Context)
Citation Context ...dicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], [11], [13], =-=[14]-=-). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide such a general solution. We tr... |

36 | System description: MathWeb, an agent-based communication layer for distributed automated theorem proving
- Franke, Kohlhase
- 1999
(Show Context)
Citation Context ...asoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], [11], [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], =-=[9]-=-). The interface described in this paper is not an attempt to provide such a general solution. We tried to make an interface which is simple, easy to implement, maintain and use and which links reason... |

36 |
The Mathematica Book, Fourth Edition
- Wolfram
- 1999
(Show Context)
Citation Context ...s with \internal" Theorema provers. 1 Introduction The Theorema system [7] is an integrated environment for proving, solving and computing built on the top of mathematical software system Mathema=-=tica [26-=-]. It was designed by Bruno Buchberger [5, 6] and provides a front end for composing formal mathematical text consisting of a hierarchy of axioms, denitions, propositions, algorithms etc. in a common ... |

26 | Symbolic Computation: Computer Algebra and Logic
- Buchberger
- 1996
(Show Context)
Citation Context ...oduction The Theorema system [7] is an integrated environment for proving, solving and computing built on the top of mathematical software system Mathematica [26]. It was designed by Bruno Buchberger =-=[5, 6-=-] and provides a front end for composing formal mathematical text consisting of a hierarchy of axioms, denitions, propositions, algorithms etc. in a common logic frame with user-extensible syntax, a l... |

14 | Towards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture
- Armando, Zini
- 2000
(Show Context)
Citation Context ...oftware/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], [11], [13], [14]). There are several platforms which try to provide a general solution to the problem (=-=[1]-=-, [8], [9]). The interface described in this paper is not an attempt to provide such a general solution. We tried to make an interface which is simple, easy to implement, maintain and use and which li... |

14 | WALDMEISTER: Development of a High Performance Completion-Based Theorem
- BUCH, HILLENBRAND
- 1996
(Show Context)
Citation Context ...provers. Currently, the following 11 external systems are supported: provers - Bliksem [19], EQP [17], E [21], Gandalf [23], Otter [16], Scott [12], Setheo [15], Spass [24], Vampire [20], Waldmeister =-=[4]-=- and asnite model and counter-example searcher Mace [18]. The interface consists of two types of links - direct and indirect - from Theorema to an external system. The indirect link is established wit... |

13 | Combining Theorem Proving and Symbolic Mathematical Computing
- Homann, Calmet
- 1995
(Show Context)
Citation Context ...he predicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], [11], =-=[13]-=-, [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide such a general solution.... |

10 |
A skeptic’s approach to combining HOL
- Harrison, Théry
- 1998
(Show Context)
Citation Context ... and the predicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], =-=[11]-=-, [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide such a general sol... |

9 |
Using Mathematica for Doing Simple Mathematical Proofs
- Buchberger
(Show Context)
Citation Context ...oduction The Theorema system [7] is an integrated environment for proving, solving and computing built on the top of mathematical software system Mathematica [26]. It was designed by Bruno Buchberger =-=[5, 6-=-] and provides a front end for composing formal mathematical text consisting of a hierarchy of axioms, denitions, propositions, algorithms etc. in a common logic frame with user-extensible syntax, a l... |

8 | A pragmatic approach to extending provers by computer algebra - with applications to coding theory
- Ballarin, Paulson
- 1999
(Show Context)
Citation Context ...bines Otter and the predicate logic prover of Theorema. 5 Related Work and Conclusion The problem of integrating software/reasoning systems has been studied intensively in the recent years (e.g. [2], =-=[3]-=-, [10], [11], [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], [8], [9]). The interface described in this paper is not an attempt to provide such a... |

8 |
algebra: Conditions that make a near-Boolean algebra Boolean
- Winker, ‘‘Robbins
- 1990
(Show Context)
Citation Context ...lt option. The notebooks on thesgures above show the black box and the white box outputs of the Otter call to prove that every Robbins algebra satisfying idempotence of addition is a Boolean algebra (=-=[25]-=-). In both cases, the output in Otter syntax can be shown in a new notebook which pops up if one clicks on the corresponding hyperlink in the proof notebook. In the back translated output each inferen... |

6 |
Theorema: A Progress Report
- Buchberger, Dupre, et al.
(Show Context)
Citation Context ...rently 11 external systems are supported. The design of the interface allows combining external systems with each other as well as with \internal" Theorema provers. 1 Introduction The Theorema sy=-=stem [7]-=- is an integrated environment for proving, solving and computing built on the top of mathematical software system Mathematica [26]. It was designed by Bruno Buchberger [5, 6] and provides a front end ... |

2 | Semantic Guidance for Saturation−based Theorem Proving
- Hodgson, Slaney
- 2000
(Show Context)
Citation Context ... Theorema session in the same way as \internal" Theorema provers. Currently, the following 11 external systems are supported: provers - Bliksem [19], EQP [17], E [21], Gandalf [23], Otter [16], S=-=cott [12]-=-, Setheo [15], Spass [24], Vampire [20], Waldmeister [4] and asnite model and counter-example searcher Mace [18]. The interface consists of two types of links - direct and indirect - from Theorema to ... |

1 | The PROSPER Toolkit
- Slind, Robinson, et al.
- 2000
(Show Context)
Citation Context ...re/reasoning systems has been studied intensively in the recent years (e.g. [2], [3], [10], [11], [13], [14]). There are several platforms which try to provide a general solution to the problem ([1], =-=[8]-=-, [9]). The interface described in this paper is not an attempt to provide such a general solution. We tried to make an interface which is simple, easy to implement, maintain and use and which links r... |

1 |
E Equational prover (2000) http://wwwjessen.informatik.tumuenchen. de/~schulz/WORK
- Schulz
(Show Context)
Citation Context ...on systems (\external" systems) within Theorema session in the same way as \internal" Theorema provers. Currently, the following 11 external systems are supported: provers - Bliksem [19], EQ=-=P [17], E [21]-=-, Gandalf [23], Otter [16], Scott [12], Setheo [15], Spass [24], Vampire [20], Waldmeister [4] and asnite model and counter-example searcher Mace [18]. The interface consists of two types of links - d... |