Synthesizing proof planning methods and Ω-ants agents from mathematical knowledge

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

Volumn 4108 LNAI, Issue , 2006, Pages 94-109

  Autexier, Serge ^a,b   Dietrich, Dominik ^b  

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

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); INFORMATION MANAGEMENT; SEARCH ENGINES;

CODING METHODS; MATHEMATICAL KNOWLEDGE; PROOF PLANNING METHODS;

MATHEMATICAL PROGRAMMING;

EID: 33749555098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11812289_9     Document Type: Conference Paper

References (17)

1. S. Autexier. The CoRE calculus. In R. Nieuwenhuis, editor, Proceedings of CADE-20, LNAI 3632, Tallinn, Estonia, July 2005. Springer.
2. S. Autexier, Chr. Benzmüller, D. Dietrich, A. Meier, and C.-P. Wirth. A generic modular data structure for proof attempts alternating on ideas and granularity. In M. Kohlhase, editor, Proceedings of MKM'05, LNAI 3863, IUB Bremen, Germany, January 2006. Springer.
3. H. Barendregt. The λ-Calculus - Its Syntax and Semantics. North Holland, 1984.
4. Chr. Benzmüller and V. Sorge. Ω-ANTS - an open approach at combining interactive and automated theorem proving. In M. Kerber and M. Kohlhase, editors, Proceedings of Calculemus-2000, St. Andrews, UK, 6-7 August 2001. AK Peters.
5. Christoph Benzmüller, Armin Fiedler, Andreas Meier, Martin Pollet, and Jörg Siekmann. Omega. In The seventeen provers of the world, number 3600 in LNAI, pages 127-141, 2006.
6. Alan Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, Proceedings of the 9th International Conference on Automated Deduction (CADE-88), LNAI, pages 111-120. Springer, 1988.
7. D. Dietrich. The task-layer of the ΩMEGA system. Diploma thesis, FR 6.2 Informatik, Universität des Saarlandes, Saarbrücken, Germany, 2006.
8. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
9. W. Farmer, J. Guttman, and F. J. Thayer. IMPS: An interactive mathematical proof system. Journal of Automated Reasoning, 11, 1993.
10. M. Fitting. First-Order Logic and Automated Theorem Proving / 2nd Edition. Springer-Verlag New York Inc., 1996. ISBN 0-387-94593-8.
11. G. Gentzen. The Collected Papers of Gerhard Gentzen (1934-1938). Edited by Szabo, M. E., North Holland, Amsterdam, 1969.
12. M. J. Gordon, A. J. Milner, and C. P. Wadsworth. Edinburgh LCF - A mechanised logic of computation. Springer Verlag, 1979. LNCS 78.
13. A. Meier and E. Melis. MULTI: A multi-strategy proof-planner. In R. Nieuwenhuis, editor, Proceedings of CADE-20, LNAI 3632, Tallinn, Estonia, July 2005. Springer.
14. J. D. C. Richardson, A. Smaill, and I. M. Green. System description: proof planning in higher-order logic with λ-clam. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-98), volume 1421 of LNAI. Springer, 1998.
15. V. Sorge. A Blackboard Architecture for the Integration of Reasoning Techniques into Proof Planning. PhD thesis, FR 6.2 Informatik, Universität des Saarlandes, Saarbrücken, Germany, Nvermber 2001.
16. B. Wack. Typage et déduction dans le calcul de réécriture. Thèse de doctorat, Université Henri Poincaré (Nancy 1), octobre 2005.
17. F. Wiedijk. Formal proof sketches. In Stefano Berardi, Mario Coppo, and Ferruccio Damiani, editors, Types for Proofs and Programs: Third International Workshop, TYPES 2003, LNCS 3085, pages 378-393, Torino, Italy, 2004. Springer.