Proof Planning

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages 261-267

  Bundy, Alan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC THEOREM PROVING; GLOBAL CONTROL; META-LOGIC; PROOF PLANS; PROOF-PLANNING;

EID: 10044299332     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Basin, D.A. and Walsh, T. (1994). Annotated rewriting in inductive theorem proving. Technical report, MPI, Submitted to JAR.
2. 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.
3. Bundy, A., van Harmelen, F., Hesketh, J. and Smaill, A. (1991). Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303-324. Earlier version available from Edinburgh as DAI Research Paper No 413.
4. 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.
5. Cantu, F., Bundy, A., Smaill, A. and Basin, D. (1996). Proof plans for automatic hardware verification. Research Paper forthcoming. Dept. of Artificial Intelligence, Edinburgh.
6. Constable, R.L., Allen, S.F., Bromley, H.M. et al. (1986). Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall.
7. Frank, I., Basin, D. and Bundy, A. (1992). An adaptation of proof-planning to declarer play in bridge. In Proceedings of ECAI-92, pages 72-76, Vienna, Austria. Longer Version available from Edinburgh as D A I Research Paper No. 575.
8. Gordon, M. J., Milner, A. J. and Wadsworth, C P. (1979). Edinburgh LCF - A mechanised logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag.
9. Ireland, A. and Bundy, A. (1995). Productive use of failure in inductive proof. Research Paper 716, Dept. of Artificial Intelligence, Edinburgh, To appear in the special issue of J A R on inductive proof.
10. Laird, J., Newell, A. and Rosenbloom, P. (1987). SOAR:an architecture for general intelligence. Artificial Intelligence, 33(l):l-64.
11. Lowe, H., Bundy, A. and McLean, D. (1995). The use of proof planning for co-operative theorem proving. Research Paper 745, Dept. of Artificial Intelligence, Edinburgh, Accepted by the special issue of the Journal of Symbolic Computation on graphical user interfaces and protocols.
12. Minton, S., Knoblock, C, Koukka, D., Gil, Y., Joseph, R. and Carbonell, J. (1989). Prodigy 2.0: The manual and tutorial. Technical Report CMU-CS-89-146, School of Computer Science, Carnegie Mellon University, Pittsburgh.
13. Richards, B.L., Kraan, I., Smaill, A. and Wiggins, G.A. (1994). Mollusc: a general proof development shell for sequent-based logics. In Bundy, A., (ed.), Î2th Conference on Automated Deduction, pages 826-30. Springer-Verlag. Lecture Notes in Artificial Intelligence, vol 814; Also available from Edinburgh as DAI Research paper 723.
14. Sacerdoti, E.D. (1977). A Structure for Plans and Behaviour. Artificial Intelligence Series. North Holland, Also as SRI AI Technical note number 109, August 1975.
15. Stefik, M. (1981). Planning and meta-planning (MOLGEN: Part 2). Artificial Intelligence, 16:141¬ 170.
16. Sussman, G.J. (1975). A Computer Model of Skill Acquisition. Artificial Intelligence Series. North Holland.
17. Tate, A. (1977). Generating project networks. In Reddy, R., (ed.). Proceedings of IJCAI-77, pages 888-893, Boston, Ma. International Joint Conference on Artificial Intelligence.
18. Walsh, T., Nunes, A. and Bundy, A. (1992). The use of proof plans to sum series. In Kapur, D., (ed.), 11th Conference on Automated Deduction, pages 325-339. Springer Verlag. Lecture Notes in Computer Science No. 607. Also available from Edinburgh as DAI Research Paper 563.
19. Yoshida, Tetsuya, Bundy, Alan, Green, Ian, Walsh, Toby and Basin, David. (1994). Coloured rippling: An extension of a theorem proving heuristic. In Cohn, A.G., (ed.). In proceedings of ECAI-9Ą, pages 85¬ 89. John Wiley.