Annotated reasoning

Annals of Mathematics and Artificial Intelligence

Volumn 29, Issue 1-4, 2000, Pages 183-222

  Hutter, Dieter ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

Automated deduction; Rippling; Strategies; Tactical theorem proving

Indexed keywords

EID: 0034561920     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018980012242     Document Type: Article

References (31)

1. S. Autexier and D. Hutter, Equational proof-planning by dynamic abstraction, in: International Workshop on First-Order Theorem Proving - FTP97, eds. U. Furbach and M.P. Bonacina, Linz, Austria, 1997, pp. 1-6, RISC-Linz Report Series No. 97-50.
2. S. Autexier, D. Hutter, H. Mantel and A. Schairer, System description: INKA 5.0 - a logical voyager, in: Proceedings 16th International Conference on Automated Deduction, CADE-16, ed. H. Ganzinger, Trento, Italy, 1999, Lecture Notes in Artificial Intelligence, Vol. 1632 (Springer-Verlag, 1999).
3. F. Baader and T. Nipkow, Term Rewriting and All That (Cambridge University Press, New York, 1998).
4. L. Bachmair, H. Ganzinger, C. Lynch and W. Snyder, Basic paramodulation and superposition, in: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), ed. D. Kapur, Saratoga Springs, NY, June 1992, Lecture Notes in Artificial Intelligence, Vol. 607 (Springer, 1992) pp. 462-476.
5. D. Basin and T. Walsh, Difference unification, in: Proceedings of 13th International Joint Conference on Artificial Intelligence (Morgan Kaufmann, 1993).
6. D. Basin and T. Walsh, A calculus for rippling, Special Issue of the J. Autom. Reason. 16(1-2) (1996) 147-180.
7. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland and A. Smaill, Rippling: A heuristic for guiding inductive proofs, Artif. Intell. 62(2) (1993) 185-253.
8. K. Konrad, C. Gardent, M. Kohlhase, Higher-order colored unification: A linguistic application. Téchnique et Sciences Informatiques 18(2), Special Issue for JFPLC-UNIF'97 (1999) 1-28.
9. V.J. Digricoli, First experiments with rue automated deduction, in: Proceedings of the 1st Annual National Conference on Artificial Intelligence, ed. R. Balzer, Stanford University, 1980 (William Kaufmann, 1980) pp. 96-98.
10. F.B. Fitch, Symbolic Logic (Ronald Press, New York, 1952).
11. D.M. Gabbay, Labelled Deductive Systems, Vol. 1 (Oxford University Press, Oxford, 1996).
12. F. Giunchiglia and T. Walsh, A theory of abstraction, Artif. Intell. 57(2-3) (1992) 323-389.
13. C. Hintermeier, C. Kirchner and H. Kirchner, Dynamically typed computations for order-sorted equational presentations, J. Symb. Comput. 25(4) (1998) 455-526.
14. J.R. Hobbs, Granularity, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence, ed. A. Joshi (Morgan Kaufmann, Los Altos, CA, 1985) pp. 1-4.
15. D. Hutter, Colouring terms to control equational reasoning, J. Autom. Reason. 18(3) (1997) 399-442.
16. D. Hutter and M. Kohlhase, Managing structural information by higher-order colored unification, J. Autom. Reason. 25(2) (2000) 123-164.
17. T. Kolbe and C. Walther, Automated deduction - a basis for applications, in: Proof Analysis, Generalization and Reuse, Vol. 2, eds. W. Bibel and P. Schmit (Kluwer Academic, 1998) pp. 189-219.
18. T. Kolbe and C. Walther, Reusing proofs, in: Proceedings of the Eleventh European Conference on Artificial Intelligence, ed. A.G. Cohn, Chichester, August 8-12, 1994 (Wiley, 1994) pp. 80-84.
19. D.W. Loveland, Automated deduction: Looking ahead, AI Magazine 20(1) (1999).
20. T.F. Melham, Formalizing abstraction mechanisms for hardware verification in higher order logic, Ph.D. thesis, Computer Laboratory, University of Cambridge (1990).
21. E. Melis and A. Schairer, Similarities and reuse of proofs in formal software verification, in: Proceedings of the 4th European Workshop on Advances in Case-Based Reasoning (EWCBR-98), eds. B. Smyth and P. Cunningham, Berlin, September 23-25, 1998, Lecture Notes in Artifical Inteligence, Vol. 1488 (Springer, 1998) pp. 76-87.
22. R. Nieuwenhuis and A. Rubio, Theorem proving with ordering constrained clauses, in: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), ed. D. Kuper, Saratoga Springs, NY, June 1992, Lecture Notes in Artifical Inteligence, Vol. 607 (Springer, 1992) pp. 477-491.
23. D. Plaisted, Abstraction mappings in mechanical theorem proving, in: Proceedings of the Fifth International Conference on Automated Deduction, Les Arcs, France, 1980, Lecture Notes in Computer Science, Vol. 87 (Springer, 1980) pp. 264-280.
24. J.R. Quinlan and E.B. Hunt, A formal deductive problem-solving system, J. of the ACM 14(4) (1986) 625-646.
25. G. Robinson and L. Wos, Paramodulation and theorem proving in first order theories with equality, Machine Intell. 4 (1969) 133-150.
26. P.J. Robinson and J. Staples, Formalizing a hierarchical structure of practical mathematical reasoning, J. Logic Comput. 3(1) (1993) 47-61.
27. M. Staples, Window inference in isabelle, in: Proceedings: Isabelle Users Workshop, 18-19 September 1995, University of Cambridge (1995), http://www.cl.cam.ac.uk/users/lcp/Workshop/index.html.
28. V.S. Subrahmaniam, Amalgamating knowledge, ACM Trans. Database Syst. 19(2) (1994) 291-331.
29. J. Tenenberg, Abstraction in planning, Technical Report TR250, University of Rochester, Rochester, New York (1988).
30. A. van Deursen, P. Klint and F. Tip, Origin tracking, J. Symb. Comput. 15 (1993) 523-545.
31. C. Walther, Many-sorted inferences in automated theorem proving, in: Sorts and Types in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Vol. 418 (Springer, 1990).