Skip to main content
SpringerLink
Log in

From MKRP to ΩMEGA

  • Chapter
Mechanizing Mathematical Reasoning

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2605))

  • 1037 Accesses

Abstract

Around 1990 the work on the first-order theorem prover MKRP stopped after a development going on for more than a decade. Instead a new system has been developed since then, the mathematical assistant Ωmega. In this contribution I try to summarise some of the discussions and decisions that led to this shift in focus and to the development of the Ωmega system, and I attempt in retrospect to give a tentative evaluation of some of the decisions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benzmüller, C., Kohlhase, M.: Leo – a higher-order theorem prover. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 81–97. Springer, Heidelberg (1998)

    Google Scholar 

  2. Bläsius, K.H.: Equality Reasoning Based on Graphs. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1986)

    Google Scholar 

  3. Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., Wos, L.: Set theory in first-order logic: Clauses for Gödel’s axioms. Journal of Automated Reasoning 2, 287–327 (1986)

    Article  MATH  Google Scholar 

  4. de Bruijn, N.G.: A survey of the project Automath. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry - Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 579–606. Academic Press, London (1980)

    Google Scholar 

  5. Benzmüller, C., Sorge, V.: Oants – an open approach at combining interactive and automated theorem proving. In: Kerber, M., Kohlhase, M. (eds.) Symbolic Calculation and Automated Reasoning: The CALCULEMUS-2000 Symposium, St. Andrews, Scotland, pp. 81–97. A.K. Peters, USA (2001)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Bürckert, H.-J.: Constraint Resolution – A Resolution Principle for Clauses with Restricted Quantifiers. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1990)

    Google Scholar 

  8. Deussen, P.: Halbgruppen und Automaten. Heidelberger Taschenbücher, vol. 99. Springer, Heidelberg (1971)

    MATH  Google Scholar 

  9. Eisinger, N.: Completeness, Confluence, and Related Properties of Clause Graph Resolution. Pitman, London (1991)

    Google Scholar 

  10. Eisinger, N., Ohlbach, H.J.: The Markgraf Karl Refutation Procedure (MKRP). In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 681–682. Springer, Heidelberg (1986)

    Google Scholar 

  11. Franke, A., Kohlhase, M.: System description: MathWeb, an agent-based communication layer for distributed automated theorem proving. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 217–221. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Herold, A.: Combination of Unification Algorithms in Equational Theories. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1987)

    Google Scholar 

  13. Huang, X., Kerber, M., Kohlhase, M., Melis, E., Nesmith, D., Richts, J., Siekmann, J.: Omega-MKRP – a proof development environment. Seki Report SR-92-22, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany (1992)

    Google Scholar 

  14. Huang, X., Kerber, M., Kohlhase, M., Melis, E., Nesmith, D., Richts, J., Siekmann, J.: KEIM: A toolkit for automated deduction. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 807–810. Springer, Heidelberg (1994)

    Google Scholar 

  15. Huang, X., Kerber, M., Kohlhase, M., Melis, E., Nesmith, D., Richts, J., Siekmann, J.: Ω-MKRP: A proof development environment. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 788–792. Springer, Heidelberg (1994)

    Google Scholar 

  16. Huang, X., Kerber, M., Kohlhase, M., Nesmith, D., Richts, J.: Guaranteeing correctness through the communication of checkable proofs (or: Would you really trust an automated reasoning system?). In: Basin, D., Giunchiglia, F., Kaufmann, M. (eds.) Proceedings of the CADE-Workshop on Metatheoretic Extensibility of Automated Reasoning Systems, Nancy, France, pp. 31–33 (1994)

    Google Scholar 

  17. Huang, X.: Human Oriented Proof Presentation: A Reconstructive Approach, infix. St. Augustin, Germany (1996)

    Google Scholar 

  18. van Benthem Jutting, L.S.: Checking Landau’s “Grundlagen” in the Automath System. Mathematical Centre Tracts, vol. 83. Mathematisch Centrum, Amsterdam, The Netherlands (1979)

    Google Scholar 

  19. Kerber, M.: Some aspects of analogy in mathematical reasoning. In: Jantke, K.P. (ed.) AII 1989. LNCS (LNAI), vol. 397, pp. 231–242. Springer, Heidelberg (1989)

    Google Scholar 

  20. Kerber, M.: On the Representation of Mathematical Concepts and their Translation into First Order Logic. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1992)

    Google Scholar 

  21. Kerber, M., Kohlhase, M.: A tableau calculus for partial functions. Collegium Logicum – Annals of the Kurt-Gödel-Society 2, 21–49 (1996)

    MathSciNet  Google Scholar 

  22. Kerber, M., Kohlhase, M., Sorge, V.: Integrating computer algebra into proof planning. Journal of Automated Reasoning 21(3), 327–355 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kohlhase, M.: A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany (1994)

    Google Scholar 

  24. Kohlhase, M.: OMDoc: Towards an internet standard for the administration, distribution and teaching of mathematical knowledge. In: Campbell, J., Roanes-Lozano, E. (eds.) AISC 2000. LNCS (LNAI), vol. 1930, p. 32. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  25. Kowalski, R.: A proof procedure using connection graphs. JACM 22 (1975)

    Google Scholar 

  26. Kerber, M., Präcklein, A.: Using tactics to reformulate formulae for resolution theorem proving. Annals of Mathematics and Artificial Intelligence 18(2-4), 221–241 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  27. Landau, E.: Grundlagen der Analysis. Akademische Verlagsgesellschaft, Leipzig, Germany, chelsea publishing, 1948 Edition (1930)

    Google Scholar 

  28. Lingenfelder, C.: Structuring computer generated proofs. In: Sridharan, N.S. (ed.) Proc. of the 11th IJCAI, Detroit, Michigan, USA, pp. 378–383. Morgan Kaufmann, San Mateo (1989)

    Google Scholar 

  29. Lingenfelder, C.: Transformation and Structuring of Computer Generated Proofs. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1990)

    Google Scholar 

  30. Lingenfelder, C., Präcklein, A.: Proof transformation with built-in equality predicate. In: Mylopoulos, J., Reiter, R. (eds.) Proc. of the 12th IJCAI, Sydney, pp. 165–170. Morgan Kaufmann, San Mateo (1991)

    Google Scholar 

  31. McCune, W.: Otter 2.0. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 663–664. Springer, Heidelberg (1990)

    Google Scholar 

  32. Raph, K.M.G.: The Markgraf Karl Refutation Procedure. Technical Report Memo-SEKI-MK-84-01, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1984)

    Google Scholar 

  33. Melis, E., Meier, A.: Proof planning with multiple strategies. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 644–659. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  34. Melis, E., Siekmann, J.H.: Knowledge-based proof planning. Artificial Intelligence 115(1), 64–105 (1999)

    Article  MathSciNet  Google Scholar 

  35. Melis, E., Zimmer, J., Müller, T.: Integrating constraint solving into proof planning. In: Ringeissen, C. (ed.) FroCos 2000. LNCS (LNAI), vol. 1794, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  36. Nederpelt, R., Geuvers, H., de Vrijer, R. (eds.): Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics, vol. 133. North-Holland, Amsterdam (1994)

    MATH  Google Scholar 

  37. Ohlbach, H.J.: A Resolution Calculus for Modal Logics. PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, Germany (1988)

    Google Scholar 

  38. Ohlbach, H.J., Siekmann, J.H.: The Markgraf Karl Refutation Procedure. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic – Essays in Honor of Alan Robinson, ch. 2, pp. 41–112. MIT Press, Cambridge (1991)

    Google Scholar 

  39. Paulson, L.C.: Isabelle: The next 700 theorem provers. Logic and Computer Science, 361–386 (1990)

    Google Scholar 

  40. Präcklein, A.: Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany (1992)

    Google Scholar 

  41. Präcklein, A. (ed.): The MKRP User-Manual. SEKI Working Paper SWP-92-03, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany (1992)

    Google Scholar 

  42. Quaife, A.: Automated deduction in von Neumann-Bernays-Gödel set theory. Journal of Automated Reasoning 8(1), 91–146 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  43. Rudnicki, P.: An overview of the Mizar project, Bastaad, Sweden (1992)

    Google Scholar 

  44. Siekmann, J., Hess, S., Benzmüller, C., Cheikhrouhou, L., Fielder, A., Horacek, H., Kohlhase, M., Konrad, K., Meier, A., Melis, E., Pollet, M., Sorge, V.: Loui: Lovely omega user interface. Formal Aspects of Computing 11, 326–342 (1999)

    Article  Google Scholar 

  45. Schütt, B., Kerber, M.: A mathematical knowledge base for proving theorems in semigroup and automata theory – Part I. SEKI Working Paper SR-93-02, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany (1993)

    Google Scholar 

  46. Schmidt-Schauß, M. (ed.): Computational Aspects of an Order-Sorted Logic with Term Declarations. LNCS (LNAI), vol. 395. Springer, Heidelberg (1989)

    MATH  Google Scholar 

  47. Walther, C.: A many–sorted calculus based on resolution and paramodulation. In: Proc. of the 8th IJCAI, Karlsruhe, Germany, pp. 882–891. Morgan Kaufmann, San Mateo (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, The University of Birmingham, Birmingham, B15 2TT, England

    Manfred Kerber

Authors
  1. Manfred Kerber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DFKI, Stuhlsatzenhausweg 3, D-66123, Saarbrücken, Germany

    Dieter Hutter

  2. German Research Center for Artificial Intelligence, DFKI GmbH,  

    Werner Stephan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kerber, M. (2005). From MKRP to ΩMEGA . In: Hutter, D., Stephan, W. (eds) Mechanizing Mathematical Reasoning. Lecture Notes in Computer Science(), vol 2605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32254-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32254-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25051-7

  • Online ISBN: 978-3-540-32254-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation