Planning and Patching Proof

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3249, Issue , 2004, Pages 26-37

  Bundy, Alan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

HIERARCHICAL STRUCTURES; PROOF METHODS; PROOF-PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 35048901617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_4     Document Type: Article

References (34)

1. [Basin & Walsh, 1993] Basin, David A. and Walsh, Toby. (1993). Difference unification. In Bajcsy, R., (ed.), Froc. 13th Intern. Joint Conference on Artificial Intelligence (IJCAI '93), volume 1, pages 116-122, San Mateo, CA. Morgan Kaufmann. Also available as Technical Report MPI-I-92-247, Max-Planck-Institut fü Informatik.
2. [Basin & Walsh, 1996] Basin, David and Walsh, Toby. (1996). A calculus for and termination of rippling. Journal of Automated Reasoning, 16(1-2):147-180.
3. [Benzmüller et al, 1997] Benzmüller, G., Cheikhrouhou, L., Fehrer, D., Fiedler, A., Huang, X., Kerber, M., Kohlhase, K., Meier, A, Melis, E., Schaarschmidt, W., Siekmann, J. and Sorge, V. (1997). mega: Towards a mathematical assistant. In McCune, W., (ed.), 14th International Conference on Automated Deduction, pages 252-255. Springer-Verlag.
4. [Boulton et al, 1998] Boulton, R., Slind, K., Bundy, A. and Gordon, M. (September/October 1998). An interface between CLAM and HOL. In Grundy, J. and Newey, M., (eds.), Proceedings of the 11th International Conference on Theorem. Proving in Higher Order Logics (TPHOLs'98), volume 1479 of Lecture Notes in Computer Science, pages 87-104, Canberra, Australia. Springer.
5. [Bundy & Green, 1996] Bundy, Alan and Green, lan. (December 1996). An experimental comparison of rippling and exhaustive rewriting. Research paper 836, Dept. of Artificial Intelligence, University of Edinburgh.
6. [Bundy & Lombart, 1995] Bundy, A. and Lombart, V. (1995). Relational rippling: a general approach. In Mellish, C., (ed.), Proceedings of IJCAI-95, pages 175-181. IJCAI.
7. [Bundy, 1988] Bundy, A. (1988). The use of explicit plans to guide inductive proofs. In Lusk, R. and Overbeek, R., (eds.), 9th International Conference on Automated Deduction, pages 111-120. Springer-Verlag. Longer version available from Edinburgh as DAI Research Paper No. 349.
8. [Bundy, 1991] Bundy, Alan. (1991). A science of reasoning. In Lassez, J.-L. and Plotkin, G., (eds.), Computational Logic: Essays in Honor of Alan Robinson, pages 178-198. MIT Press. Also available from Edinburgh as DAI Research Paper 445.
9. [Bundy, 2001] Bundy, Alan. (2001). The automation of proof by mathematical induction. In Robinson, A. and Voronkov, A., (eds.), Handbook of Automated Reasoning, Volume 1. Elsevier.
10. [Bundy, 2002] Bundy, A. (2002). A Critique of Proof Planning, pages 160-177. Springer.
11. [Bundy et al, 1989] Bundy, A., van Harmelen, F., Hesketh, J., Smaill, A. and Stevens, A. (1989). A rational reconstruction and extension of recursion analysis. In Sridharan, N. S., (ed.), Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 359-365. Morgan Kaufmann. Also available from Edinburgh as DAI Research Paper 419.
12. [Bundy et al, 1990] Bundy, A., van Harmelen, F., Horn, C. and Smaill, A. (1990). The Oyster-Clam system. In Stickel, M. E., (ed.), 10th International Conference on Automated Deduction, pages 647-648. Springer-Verlag. Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 507.
13. [Bundy et al, 1993] Bundy, A., Stevens, A., van Harmelen, F., Ireland, A. and Smaill, A. (1993). Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185-253. Also available from Edinburgh as DAI Research Paper No. 567.
14. [Bundy et al, 2005] Bundy, A., Basin, D., Hutter, D. and Ireland, A. (2005). Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press.
15. [Dennis et al, 2000] Dennis, L., Bundy, A. and Green, I. (2000). Making a productive use of failure to generate witness for coinduction from divergent proof attempts. Annals of Mathematics and Artificial Intelligence, 29:99-138. Also available as paper No. RR0004 in the Informatics Report Series.
16. [Desimone, 1989] Desimone, R. V. (1989). Explanation-Based Learning of Proof Plans. In Kodratoff, Y. and Hutchinson, A., (eds.), Machine and Human Learning. Kogan Page. Also available as DAI Research Paper 304. Previous version in proceedings of EWSL-86.
17. [Dixon & Fleuriot, 2003] Dixon, L. and Fleuriot, J. D. (2003). IsaPlanner: A prototype proof planner in Isabelle. In Proceedings of CADE'03, Lecture Notes in Computer Science.
18. [Duncan et al, 2004] Duncan, H., Bundy, A., Levine, J., Storkey, A. and Pollet, M. (2004). The use of data-mining for the automatic formation of tactics. In Workshop on Computer-Supported Mathematical Theory Development. IJCAR-04.
19. [Frank & Basin, 1998] Frank, I. and Basin, D. (1998). Search in games with incomplete information: A case study using bridge card play. Artificial Intelligence, 100(12):87-123.
20. [Frank et al, 1992] Frank, L, Basin, D. and Bundy, A. (1992). An adaptation of proofplanning to declarer play in bridge. In Proceedings of ECAI-92, pages 72-76, Vienna, Austria. Longer Version available from Edinburgh as DAI Research Paper No. 575.
21. [Gow, 2004] Gow, Jeremy. (2004). The Dynamic Creation of Induction Rules Using Proof Planning. Unpublished Ph.D. thesis, Division of Informatics, University of Edinburgh.
22. [Hutter & Kohlhase, 1997] Hutter, D. and Kohlhase, M. (1997). A colored version of the λ-Calculus. n McCune, W., (ed.), 14th International Conference on Automated Deduction, pages 291-305. Springer-Verlag. Also available as SEKI-Report SR-9505.
23. [Ireland & Bundy, 1996] Ireland, A. and Bundy, A. (1996). Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(l-2):79-111. Also available from Edinburgh as DAI Research Paper No 716.
24. [Ireland, 1992] Ireland, A. (1992). The Use of Planning Critics in Mechanizing Inductive Proofs. In Voronkov, A., (ed.), International Conference on Logic Programming and Automated Reasoning - LPAR 92, St. Petersburg, Lecture Notes in Artificial Intelligence No. 624, pages 178-189. Springer-Verlag. Also available from Edinburgh as DAI Research Paper 592.
25. [Jackson & Lowe, 2000] Jackson, M. and Löwe, H. (June 2000). XBarnacle: Making theorem provers more accessible. In McAllester, D., (ed.), CADE17, number 1831 in Lecture Notes in Computer Science, Pittsburg. Springer.
26. [Kraan et al, 1996] Kraan, L, Basin, D. and Bundy, A. (1996). Middle-out reasoning for synthesis and induction. Journal of Automated Reasoning, 16(1-2):113-145. Also available from Edinburgh as DAI Research Paper 729.
27. [Lowe & Duncan, 1997] Lowe, H. and Duncan, D. (1997). XBarnacle: Making theorem provers more accessible. In McCune, William, (ed.), 14th International Conference on Automated Deduction, pages 404-408. Springer-Verlag.
28. [Lowe et al, 1998] Lowe, H., Pechoucek, M. and Bundy, A. (1998). Proof planning for maintainable configuration systems. Artificial Intelligence in Engineering Design, Analysis and Manufacturing, 12:345-356. Special issue on configuration.
29. [Monroy et al, 1994] Monroy, R., Bundy, A. and Ireland, A. (1994). Proof Plans for the Correction of False Conjectures. In Pfenning, F., (ed.), 5th International Conference on Logic Programming and Automated Reasoning, LP AR'94, Lecture Notes in Artificial Intelligence, v. 822, pages 54-68, Kiev, Ukraine. Springer-Verlag. Also available from Edinburgh as DAI Research Paper 681.
30. [Silver, 1985] Silver, B. (1985). Meta-level inference: Representing and Learning Control Information in Artificial Intelligence. North Holland, Revised version of the author's PhD thesis, Department of Artificial Intelligence, U. of Edinburgh, 1984.
31. [Smaill & Green, 1996] Smaill, Alan and Green, Jan. (1996). Higher-order annotated terms for proof search. In von Wright, Joakim, Grundy, Jim and Harrison, John, (eds.), Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs'96, volume 1275 of Lecture Notes in Computer Science, pages 399-414, Turku, Finland. Springer-Verlag. Also available as DAI Research Paper 799.
32. [Stark & Ireland, 1998] Stark, J. and Ireland, A. (1998). Invariant discovery via failed proof attempts. In Flener, P., (ed.), Logic-based Program Synthesis and Transformation, number 1559 in LNCS, pages 271-288. Springer-Verlag.
33. [Sterling et al, 1989] Sterling, L., Bundy, Alan, Byrd, L., O'Keefe, R. and Silver, B. (1989). Solving symbolic equations with PRESS. J. Symbolic Computation, 7:7184. Also available from Edinburgh as DAI Research Paper 171.
34. [Willmott et al, 2001] Willmott, S., Richardson, J. D. C., Bundy, A. and Levine, J. M. (2001). Applying adversarial planning techniques to Go. Journal of Theoretical Computer Science, 252(l-2):45-82. Special issue on algorithms, Automata, complexity and Games.