## Employing External Reasoners in Proof Planning (1999)

Venue: | In CALCULEMUS 99, Electronic Notes in Theoretical Computer Science |

Citations: | 5 - 4 self |

### BibTeX

@TECHREPORT{Melis99employingexternal,

author = {Erica Melis and Volker Sorge},

title = {Employing External Reasoners in Proof Planning},

institution = {In CALCULEMUS 99, Electronic Notes in Theoretical Computer Science},

year = {1999}

}

### Abstract

This paper describes a the integration of computer algebra systems and constraint solvers into proof planners. It shows how efficient external reasoners can be employed in proof planning and how the shortcuts of the external reasoners can be expanded to verifiable natural deduction proofs in the proof planning framework. It illustrates the integration and cooperation of the external reasoners with an example from proof planning limit theorems.

### Citations

1748 |
Strips: A New Approach to the Application of Theorem Proving to Problem Solving
- Fikes, Nilsson
- 1971
(Show Context)
Citation Context ...Technically, Bundy [4] introduced these methods as (partial) specifications of tactics known from tactical theorem proving [7]. The basic approach to proof planning is essentially that of AI-planning =-=[6]-=-. In the\Omega mega system [2], a planning state is a set of sequents that is divided into goals and assumptions. A proof planning problem is defined by an initial state specified by the proof assumpt... |

384 |
Incremental constraint satisfaction in logic programming
- Hentenryck
- 1989
(Show Context)
Citation Context ...lvers can check consistency and propagate value restrictions of variables very efficiently because they provide efficient data structures and algorithms for specific domains, e.g., for finite domains =-=[9]-=-, for sets [15], and for linear arithmetic in the set of real numbers R [11]. Therefore, constraint solvers are attached to a particular theory Th that is stored in a hierarchically organized mathemat... |

303 |
The CLP(R) language and system
- Jaffar, Michaylow, et al.
- 1992
(Show Context)
Citation Context ...ery efficiently because they provide efficient data structures and algorithms for specific domains, e.g., for finite domains [9], for sets [15], and for linear arithmetic in the set of real numbers R =-=[11]-=-. Therefore, constraint solvers are attached to a particular theory Th that is stored in a hierarchically organized mathematical knowledge base of the\Omega mega system. The theory's domain knowledge ... |

267 | The use of explicit plans to guide inductive proofs
- Bundy
- 1988
(Show Context)
Citation Context ...earch at the calculus level, proof planning employs abstract plan operators, called methods, that encapsulate (mathematical) proof techniques such as diagonalization and induction. Technically, Bundy =-=[4]-=- introduced these methods as (partial) specifications of tactics known from tactical theorem proving [7]. The basic approach to proof planning is essentially that of AI-planning [6]. In the\Omega mega... |

107 | Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic
- Boyer, Moore
- 1988
(Show Context)
Citation Context ...sirable in order to restrict variable instantiations with the help of domain specific knowledge. Usually, these external systems have their own efficient data structures and algorithms. As known from =-=[3]-=-, for instance, their integration into automated theorem proving systems can be very difficult and time consuming. This paper describes the collaboration of the CAS Maple [14] and a constraint solver ... |

100 | Edinburgh LCF: a mechanized logic of computation - Gordon, Milner, et al. - 1979 |

66 | OMEGA: Towards a mathematical assistant - Benzmüller, Cheikhrouhou, et al. - 1997 |

50 | Theorems and algorithms: An interface between Isabelle and Maple
- Ballarin, Homann, et al.
- 1995
(Show Context)
Citation Context ...�� CAS �� expand with PDS compute with Maple result proof plan initialize reflect plan LINEQ tell ask Figure 2: Integration of Proof Planning with External Reasoners systems (similar to approa=-=ches of [1, 8, 5]-=-) and thus sapper works as simple bridge between the planner and the CAS. On the other hand, sapper also has the ability to use a CAS as a proof planner itself. That is, if the CAS can provide additio... |

41 | Integrating computer algebra into proof planning
- Kerber, Kohlhase, et al.
- 1998
(Show Context)
Citation Context ...--- called sapper --- can uniformly integrate arbitrary CAS in both the planning process and the interactive tactical theorem proving within the PDS itself. For an extensive description of sapper see =-=[12]-=-. The upper half of Fig. 2 shows how the constraint solver LinEq is integrated. It is basically only connected to the proof planner itself which both initializes and employs it. Furthermore, LinEq is ... |

36 | Analytica: A theorem prover for Mathematica
- Clarke, Zhao
- 1993
(Show Context)
Citation Context ...�� CAS �� expand with PDS compute with Maple result proof plan initialize reflect plan LINEQ tell ask Figure 2: Integration of Proof Planning with External Reasoners systems (similar to approa=-=ches of [1, 8, 5]-=-) and thus sapper works as simple bridge between the planner and the CAS. On the other hand, sapper also has the ability to use a CAS as a proof planner itself. That is, if the CAS can provide additio... |

24 | A resolution principle for constrained logics - Bürckert - 1994 |

23 |
The Maple Handbook: Maple V Release 5
- Redfern
- 1999
(Show Context)
Citation Context ...algorithms. As known from [3], for instance, their integration into automated theorem proving systems can be very difficult and time consuming. This paper describes the collaboration of the CAS Maple =-=[14]-=- and a constraint solver for linear inequalities (LinEq) within proof planning by a concrete example from proof planning limit theorems [13]. We show how efficient external reasoners can be generally ... |

21 |
C.P.: Edinburgh LCF: A Mechanized Logic of Computation. Volume 78 of LNCS
- Gordon, Milner, et al.
- 1979
(Show Context)
Citation Context ...ulate (mathematical) proof techniques such as diagonalization and induction. Technically, Bundy [4] introduced these methods as (partial) specifications of tactics known from tactical theorem proving =-=[7]-=-. The basic approach to proof planning is essentially that of AI-planning [6]. In the\Omega mega system [2], a planning state is a set of sequents that is divided into goals and assumptions. A proof p... |

20 | The “limit” domain
- Melis
- 1998
(Show Context)
Citation Context ...ng. This paper describes the collaboration of the CAS Maple [14] and a constraint solver for linear inequalities (LinEq) within proof planning by a concrete example from proof planning limit theorems =-=[13]-=-. We show how efficient external reasoners can be generally employed in proof planning and also describe how the shortcuts introduced by external reasoners in proofs can be expanded to checkable Natur... |

18 | Membership-Constraint and Complexity in Logic Programming with Sets
- Stolzenburg
- 1996
(Show Context)
Citation Context ...k consistency and propagate value restrictions of variables very efficiently because they provide efficient data structures and algorithms for specific domains, e.g., for finite domains [9], for sets =-=[15]-=-, and for linear arithmetic in the set of real numbers R [11]. Therefore, constraint solvers are attached to a particular theory Th that is stored in a hierarchically organized mathematical knowledge ... |

17 | Methods - The Basic Units for Planning and Verifying Proofs
- Huang, Kerber, et al.
- 1994
(Show Context)
Citation Context ... the methods in a complete plan yields a calculus-level proof, e.g., a ND-proof that can be proof checked. 2.1 Methods in\Omega mega \Omega mega's methods are structures whose format is introduced in =-=[10]-=-. They have the slots premises, conclusions, application-conditions, and proof schema. Premises are (annotated 1 ) sequents that are used by a method to logically derive the conclusions, and conclusio... |

10 | Reasoning About the Reals: The Marriage of HOL and Maple
- Harrison, Thery
- 1993
(Show Context)
Citation Context ...�� CAS �� expand with PDS compute with Maple result proof plan initialize reflect plan LINEQ tell ask Figure 2: Integration of Proof Planning with External Reasoners systems (similar to approa=-=ches of [1, 8, 5]-=-) and thus sapper works as simple bridge between the planner and the CAS. On the other hand, sapper also has the ability to use a CAS as a proof planner itself. That is, if the CAS can provide additio... |

3 |
Towards a Mathematical Assistant
- \Omega\Gammarge
- 1997
(Show Context)
Citation Context ...ced these methods as (partial) specifications of tactics known from tactical theorem proving [7]. The basic approach to proof planning is essentially that of AI-planning [6]. In the\Omega mega system =-=[2]-=-, a planning state is a set of sequents that is divided into goals and assumptions. A proof planning problem is defined by an initial state specified by the proof assumptions and the goal g given by t... |

2 | and Xudong Zhao. Analytica-A Theorem Prover in Mathematica - Clarke - 1992 |