论文信息 - Autotically Synthesized Term Denotation Predicates: A Proof Aid

Autotically Synthesized Term Denotation Predicates: A Proof Aid

In goal-directed proofs, such as those used in HOL, tactics often must operate on one or more specific assumptions. But goals often have many assumptions. Currently there is no good way to select or denote assumptions in HOL88. Most mechanisms are sensitive to inconsequential changes or are difficult to use.

Phillip J. Windley | Paul E. Black

[1] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[2] Phillip J. Windley,et al. A Correctness Model for Pipelined Multiprocessors , 1994, TPCD.

[3] John R. Anderson,et al. MACHINE LEARNING An Artificial Intelligence Approach , 2009 .

[4] Ching-Tsun Chou. A Note on Interactive Theorem Proving with Theorem Continuation Functions , 1992, TPHOLs.

[5] Larry A. Rendell,et al. A Practical Approach to Feature Selection , 1992, ML.

[6] Steven L. Tanimoto. The elements of artificial intelligence , 1800 .

[7] Arno Sprecher,et al. An Artificial Intelligence Approach , 1994 .

[8] Eugene Charniak,et al. Artificial Intelligence Programming , 1987 .

[9] Karl N. Levitt,et al. Implementation and Use of Annotations in HOL , 1992, TPHOLs.

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