Proof planning with multiple strategies

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 644-659

  Melis, Erica ^a   Meier, Andreas ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX PROBLEMS; MULTIPLE STRATEGY; PLANNING SYSTEMS; PROOF-PLANNING; SOLVING MECHANISM;

LOGIC PROGRAMMING; THEOREM PROVING;

PROBLEM SOLVING;

EID: 84867823612     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_43     Document Type: Conference Paper

References (24)

1. Gandalf. In CASC-14 http://www.cs.jcu.edu.au/~tptp/casc-14/, 1997.
2. R.G. Bartle and D.R. Sherbert. Introduction to Real Analysis. John Wiley& Sons, New York, 1982.
3. C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, A. Meier, E. Melis, W. Schaarschmidt, J. Siekmann, and V. Sorge. OMEGA: Towards a mathematical assistant. In Proc. CADE-14, pages 252-255. Springer-Verlag, 1997.
4. C. Benzmüller, M. Jamnik, M. Kerber, and V. Sorge. Agent Based Mathematical Reasoning? In 7th CALCULEMUS Workshop, pages 21-32, 1999.
5. W.W. Bledsoe, R.S. Boyer, and W.H. Henneman. Computer proofs of limit theorems. Artificial Intelligence, 3(1):27-60, 1972.
6. A. Bundy. The use of explicit plans to guide inductive proofs. In Proc. of CADE-9, pages 111-120, 1988.
7. A. Bundy, A. Stevens, F. Van Harmelen, A. Ireland, and A. Smaill. A heuristic for guiding inductive proofs. Artificial Intelligence, 63:185-253, 1993.
8. A. Bundy,F. Van Harmelen,J. Hesketh,A. Smaill Experiments with proof plans for induction Journal of Automated Reasoning 7, 303-324, 1991.
9. J. Denzinger and M. Fuchs. Cooperation of heterogeneous provers. In Proc. of IJCAI, pages 10-15. Morgan Kaufmann, 1999.
10. B. Hayes-Roth. A blackboard architecture for control. Artificial Intelligence, pages 251-321, 1985.
11. A. Irel and and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2):79-111, 1996.
12. W.W. McCune. Otter 2.0 users guide. Technical Report ANL-90/9, Argonne National Laboratory, 1990.
13. E. Melis. AI-techniques in proof planning. In Proc. of European Conference on Artificial Intelligence, pages 494-498. Kluwer, 1998.
14. E. Melis. Combining proof planning with constraint solving. In Proc. of Calculemus and Types'98, 1998.
15. E. Melis. The\ limit" domain. In Proc. of the Fourth International Conference on Artificial Intelligence in Planning Systems (AIPS'98), pages 199-206, 1998.
16. E. Melis and A. Meier. Proof planning with multiple strategies. Seki report SR-99-06, Universität des Saarlandes, FB Informatik, 1999.
17. E. Melis and A. Meier. Proof planning with multiple strategies II. In FLoC'99 workshop on Strategies in Automated Deduction, pages 61-72, 1999.
18. E. Melis and J.H. Siekmann. Kn owledge-based proof planning. Artificial Intelli-gence, 1999.
19. E. Melis and C. Ullrich. Flexibly interleaving processes. In K.-D. Altho-And R. Bergmann, editors, International Conference on Case-Based Reaso ning, volume 1650 of Lecture Notes in Artificial Intelligence, pages 263-275. Springer, 1999.
20. G. Polya. How to Solve it. Princeton University Press, Princeton, 1945.
21. A.H. Schoenfeld. Mathematical Problem Solving. Academic Press, New York, 1985.
22. D.S. Weld. An introduction to least committment planning. AI magazine, 15(4):27-61, 1994.
23. D.E. Wilkins and K.L. Myers. A multiagent planning architecture. In Proc. of the Fourth International Conference on AI Planning Systems (AIPS'98), pages 154-162, 1998.
24. A. Wolf. Strate gy selection for automated theorem proving. In Proc. of AIMSA'98, pages 452-465, 1998.