Abstract
In this paper we investigate how to extract proof procedural information contained in declarative representations of mathematical knowledge, such as axioms, definitions, lemmas and theorems (collectively called assertions) and how to effectively include it into automated proof search techniques. In the context of the proof planner Multi and the agent-based reasoning system Ω-Ants, we present techniques to automatically synthesize proof planning methods and Ω-Ants-agents from assertions such that they can be actively used by these systems. This in turn enables a user to effectively use these systems without having to know the peculiarities of coding methods and agents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Autexier, S.: The CoRe calculus. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, Springer, Heidelberg (2005)
Autexier, S., Benzmüller, Chr., Dietrich, D., Meier, A., Wirth, C.-P.: A generic modular data structure for proof attempts alternating on ideas and granularity. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol. 3863, Springer, Heidelberg (2006)
Barendregt, H.: The λ-Calculus - Its Syntax and Semantics. North-Holland, Amsterdam (1984)
Benzmüller, C., Sorge, V.: OANTS – an open approach at combining interactive and automated theorem proving. In: Kerber, M., Kohlhase, M. (eds.) Proceedings of Calculemus-2000, St. Andrews, UK, pp. 6–7. AK Peters (August 2001)
Benzmüller, C., Fiedler, A., Meier, A., Pollet, M., Siekmann, J.: Omega. In: Wiedijk, F. (ed.) The Seventeen Provers of the World. LNCS (LNAI), vol. 3600, pp. 127–141. Springer, Heidelberg (2006)
Bundy, A.: The use of explicit plans to guide inductive proofs. In: Lusk, E.‘., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 111–120. Springer, Heidelberg (1988)
Dietrich, D.: The task-layer of the Ωmega system. Diploma thesis, FR 6.2 Informatik, Universität des Saarlandes, Saarbrücken, Germany (2006)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Farmer, W., Guttman, J., Thayer, F.J.: IMPS: An interactive mathematical proof system. Journal of Automated Reasoning 11 (1993)
Fitting, M.: First-Order Logic and Automated Theorem Proving. In: First-Order Logic and Automated Theorem Proving /, 2nd edn., Springer, Heidelberg (1996)
Gentzen, G.: The Collected Papers of Gerhard Gentzen (1934-1938). In: Szabo, M.E. (ed.), North Holland, Amsterdam (1969)
Gordon, M., Wadsworth, C.P., Milner, R.: Edinburgh LCF. LNCS, vol. 78. Springer, Heidelberg (1979)
Meier, A., Melis, E.: Multi: A multi-strategy proof-planner. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, Springer, Heidelberg (2005)
Richardson, J.D.C., Smaill, A., Green, I.M.: System description: proof planning in higher-order logic with λ-clam. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, Springer, Heidelberg (1998)
Sorge, V.: 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 (November 2001)
Wack, B.: Typage et déduction dans le calcul de réécriture. Thèse de doctorat, Université Henri Poincaré (Nancy 1) (October 2005)
Wiedijk, F.: Formal proof sketches. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 378–393. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Autexier, S., Dietrich, D. (2006). Synthesizing Proof Planning Methods and Ω-Ants Agents from Mathematical Knowledge. In: Borwein, J.M., Farmer, W.M. (eds) Mathematical Knowledge Management. MKM 2006. Lecture Notes in Computer Science(), vol 4108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812289_9
Download citation
DOI: https://doi.org/10.1007/11812289_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37104-5
Online ISBN: 978-3-540-37106-9
eBook Packages: Computer ScienceComputer Science (R0)