Employing external reasoners in proof planning

Abstract This paper describes 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. In particular, these shortcuts simplify and guide the formal proof. The paper illustrates the integration and cooperation of the external reasoners with an example from proof planning limit theorems.

[1]  David A. Redfern,et al.  The Maple Handbook: Maple V Release 3 , 1995 .

[2]  Darren Redfern,et al.  The Maple handbook , 1994 .

[3]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[4]  John Harrison,et al.  Reasoning About the Reals: The Marriage of HOL and Maple , 1993, LPAR.

[5]  Volker Sorge,et al.  ΩMEGA : Towards a mathematical assistant , 1997 .

[6]  Volker Sorge,et al.  Omega: Towards a Mathematical Assistant , 1997, CADE.

[7]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[8]  Xiaorong Huang,et al.  Methods - The Basic Units for Planning and Verifying Proofs , 1999 .

[9]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[10]  Hans-Jürgen Bürckert,et al.  A Resolution Principle for Constrained Logics , 1994, Artif. Intell..

[11]  Robert S. Boyer,et al.  Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic , 1988 .

[12]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[13]  Erica Melis.  The "Limit" Domain , 1998, AIPS.

[14]  Edmund M. Clarke,et al.  Analytica - A Theorem Prover in Mathematica , 1992, CADE.

[15]  Robin Milner,et al.  Edinburgh lcf: a mechanized logic of computation , 1978 .

[16]  Frieder Stolzenburg,et al.  Membership-Constraints and Complexity in Logic Programming with Sets , 1996, FroCoS.

[17]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[18]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.