Abstract
Real-world applications of theorem proving require open and modern software environments that enable modularization, distribution, inter-operability, networking, and coordination. This system description presents the MathWeb1 approach for distributed automated theorem proving that connects a wide-range of mathematical services by a common, mathematical software bus. The MathWeb system provides the functionality to turn existing theorem proving systems and tools into mathematical services that are homogeneously integrated into a networked proof development environment. The environment thus gains the services from these particular modules, but each module in turn gains from using the features of other, plugged-in components.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3):321–353, 1996.
C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, and V. Sorge. mega: Towards a mathematical assistant. InWilliam McCune, editor, Proceedings of the 14th Conference on Automated Deduction, number 1249 in LNAI, pages 252–255, Townsville, Australia, 1997. Springer Verlag.
Christoph Benzmüller and Michael Kohlhase. LEO-a higher order theorem prover. In Claude Kirchner and Hél*#x00E8;ne Kirchner, editors, Proceedings of the 15th Conference on Automated Deduction, number 1421 in LNAI, pages 139–144, Lindau, Germany, 1998. Springer Verlag.
The open math standard. Open Math Consortium, http://www.openmath.org, 1998.
T. Finin and R. Fritzson. KQML — a language and protocol for knowledge and information exchange. In Proceedings of the 13th Intl. Distributed Artificial Intelligence Workshop, pages 127–136, Seattle, WA, USA, 1994.
Andreas Franke, Stephan M. Hess, Christoph G. Jung, Michael Kohlhase, and Volker Sorge. Agent-oriented integration of distributed mathematical services. Journal of Universal Computer Science, 1999. forthcoming. 8 Either by using MathWeb directly, or by cooperating with the authors.
Xiaorong Huang and Armin Fiedler. Presenting machine-found proofs. In M.A. McRobbie and J.K. Slaney, editors, Proceedings of the 13th Conference on Automated Deduction, number 1104 in LNAI, pages 221–225, New Brunswick, NJ, USA, 1996. Springer Verlag.
Manfred Kerber, Michael Kohlhase, and Volker Sorge. Integrating computer algebra into proof planning. Journal of Automated Reasoning, 21(3):327–355, 1998.
Andreas Meier. Translation of automatically generated proofs at assertion level. Technical Report forthcoming, Universität des Saarlandes, 1999.
Jörg Siekmann, Stephan Hess, Christoph Benzmüller, Lassaad Cheikhrouhou, Detlef Fehrer, Armin Fiedler, Helmut Horacek, Michael Kohlhase, Karsten Konrad, Andreas Meier, Erica Melis, and Volker Sorge. A distributed graphical user interface for the interactive proof system OMEGA. In Roland C. Backhouse, editor, User Interfaces for Theorem Provers, number 98-08 in Computing Science Reports, pages 130–138, Department of Mathematics and Computing Science, Eindhoven Technical University, 1998.
M. Kohlhase, S. Hess, Ch. Jung and V. Sorge. An implementation of distributed mathematical services. In 6th CALCULEMUS and TYPES Workshop, Eindhoven, The Netherlands, July 13–15 1998. Electronic Procedings: http://www.win.tue.nl/math/dw/pp/calc/proceedings.html.
Jon Siegel. CORBA: Fundamentals and Programming. John Wiley & Sons, Inc., 1996.
Geoff Sutcliffe and Christian Suttner. The cade-14 atp system competition. Journal of Automated Reasoning, 21(2):177–203, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franke, A., Kohlhase, M. (1999). System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-48660-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66222-8
Online ISBN: 978-3-540-48660-2
eBook Packages: Springer Book Archive