The Use of Planning Critics in Mechanizing Inductive Proofs
暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .
[2] A. Bundy,et al. Turning eureka steps into calculations in automatic program synthesis , 1990 .
[3] Jane Thurmann Hesketh,et al. Using middle-out reasoning to guide inductive theorem proving , 1992 .
[4] P. Martin-Löf. Constructive mathematics and computer programming , 1984 .
[5] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.
[6] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.
[7] Frank van Harmelen,et al. A Rational Reconstruction and Extension of Recursion Analysis , 1989, IJCAI.
[8] Earl David Sacerdoti,et al. A Structure for Plans and Behavior , 1977 .
[9] Per Martin-Löf,et al. Constructive mathematics and computer programming , 1984 .
[10] David E. Wilkins,et al. Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.
[11] Michael J. C. Gordon,et al. Edinburgh LCF: A mechanised logic of computation , 1979 .
[12] Frank van Harmelen,et al. Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.