Planning and Presenting Construction Proofs Automatically

[1]  Frank van Harmelen,et al.  Experiments with proof plans for induction , 2004, Journal of Automated Reasoning.

[2]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

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

[4]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[5]  Robert S. Boyer,et al.  Computer Proofs of Limit Theorems , 1971, IJCAI.

[6]  Uri Leron.  Heuristic Presentations: The Role of Structuring. , 1985 .

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

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

[9]  Dieter Hutter,et al.  Guiding Induction Proofs , 1990, CADE.

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

[11]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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

[13]  Xiaorong Huang,et al.  Proof Verbalization as an Application of NLG , 1997, IJCAI.

[14]  Alan Bundy,et al.  Planning and Proof Planning , 1996 .

[15]  Christian Holzbaur.  OFAI clp(Q,R) Manual , 1995 .

[16]  Robert G. Bartle,et al.  Introduction to real analysis / Robert G. Bartle , 2002 .

[17]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..