论文信息 - An Interface between Clam and HOL

An Interface between Clam and HOL

This paper describes an interface between the CLAM proof planner and the HOL interactive theorem prover. The interface sends HOL goals to CLAM for planning, and translates plans back into HOL tactics that solve the initial goals. The combined system is able to automatically prove a number of theorems involving recursively defined functions.

[1] Patrick Brézillon,et al. Lecture Notes in Artificial Intelligence , 1999 .

[2] Fausto Giunchiglia,et al. Reasoning Theories: Towards an Architecture for Open Mechanized Reasoning Systems , 1994, FroCoS.

[3] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[4] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[5] Frank van Harmelen,et al. The Oyster-Clam System , 1990, CADE.

[6] Konrad Slind. Derivation and Use of Induction Schemes in Higher-Order Logic , 1997, TPHOLs.

[7] Amy P. Felty,et al. Hybrid Interactive Theorem Proving Using Nuprl and HOL , 1997, CADE.

[8] Konrad Slind,et al. Function Definition in Higher-Order Logic , 1996, TPHOLs.

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

[10] Natarajan Shankar. PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[11] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

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

[13] Frank van Harmelen,et al. Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..

[14] Richard J. Boulton,et al. Combining Decision Procedures in the HOL System , 1995, TPHOLs.