A divergence critic

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

Volumn 814 LNAI, Issue , 1994, Pages 14-28

  Walsh, Toby ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

INDUCTIVE THEOREM PROVERS;

THEOREM PROVING;

EID: 84968367350     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58156-1_2     Document Type: Conference Paper

References (16)

1. R. Aubin. Mechanizing Structural Induction. PhD thesis, University of Edinburgh, 1976.
2. D. Basin and T. Walsh. Difference matching. In D. Kapur, editor, 11th Conference on Automated Deduction, pages 295-309. Springer Verlag, 1992. Lecture Notes in Computer Science No. 607.
3. D. Basin and T. Walsh. Difference unification. In Proceedings of the 13th IJCAI. International Joint Conference on Artificial Intelligence, Chambery, France, 1993.
4. A. Bouhoula, and M. Rusinowitch. Automatic Case Analysis in Proof by Induction. In Proceedings of the 13th IJCAI. International Joint Conference on Artificial Intelligence, Chambery, France, 1993.
5. R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.
6. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence, 62:185-253, 1993.
7. N. Dershowitz and E. Pinchover. Inductive Synthesis of Equational Programs. In Proceedings of the 8th National Conference on AI, pages 234-239. American Association for Artificial Intelligence, 1990.
8. M. Hermann. Crossed term rewriting systems. CRIN Report 89-R-003, Centre de Recherche en Informatique de Nancy, 1989.
9. A. Ireland. The Use of Planning Critics in Mechanizing Inductive Proof. In Proceedings of LPAR’92. Springer-Verlag, 1992. Lecture Notes in Artificial Intelligence 624.
10. A. Ireland and A. Bundy. Using failure to guide inductive proof. Technical report 613, Dept, of Artificial Intelligence, University of Edinburgh, 1992.
11. H. Kirchner. Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes. In Proceedings of RTA’87, pages 180-191, 1987.
12. M. Protzen. Disproving conjectures. In D. Kapur, editor, 11th Conference on Automated Deduction, pages 340-354. Springer Verlag, 1992. Lecture Notes in Computer Science No. 607.
13. M. Thomas and K.P. Jantke. Inductive Inference for Solving Divergence in Knuth- Bendix Completion. In Proceedings of International Workshop AII’89, pages 288-303, 1989.
14. M. Thomas and P. Watson. Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science, 112:145-185, 1993.
15. T. Walsh, A. Nunes, and A. Bundy. The use of proof plans to sum series. In D. Kapur, editor, 11th Conference on Automated Deduction, pages 325-339. Springer Verlag, 1992. Lecture Notes in Computer Science No. 607.
16. T. Yoshida, A. Bundy, I. Green, T. Walsh, and D. Basin. Coloured rippling: the extension of a theorem proving heuristic. Technical Report, Dept, of Artificial Intelligence, University of Edinburgh, 1993.