Skip to main content
SpringerLink
Log in

Proof Development with Ωmega

  • Conference paper
  • First Online:
Book cover Automated Deduction—CADE-18 (CADE 2002)

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

Included in the following conference series:

Abstract

The Ωmega proof development system [2] is the core of several related and well integrated research projects of the Ωmega research group.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. S. Allen, R. Constable, R. Eaton, C. Kreitz, and L. Lorigo. The Nuprl open logical environment. In Proc. of CADE-17, LNAI 1831. Springer, 2000.

    Google Scholar 

  2. C. Benzmüller et al. Ωmega: Towards a mathematical assistant. In Proc. of CADE-14, LNAI 1249. Springer, 1997.

    Google Scholar 

  3. C. Benzmüller and V. Sorge. Ω-Ants-An open Approach at Combining Interactive and Automated Theorem Proving. In Proc. of Calculemus-2000. AK Peters, 2001.

    Google Scholar 

  4. W.W. Bledsoe. Challenge problems in elementary analysis. Journal of Automated Reasoning, 6:341–359, 1990.

    Article  MATH  Google Scholar 

  5. A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In Proc. of CADE-9, LNCS 310. Springer, 1988.

    Google Scholar 

  6. A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303–324, 1991. Earlier version available from Edinburgh as DAI Research Paper No 413.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Cheikhrouhou and V. Sorge. PDS — A Three-Dimensional Data Structure for Proof Plans. In Proc. of ACIDCA’2000, 2000.

    Google Scholar 

  8. A. Church. A Formulation of the Simple Theory of Types. The Journal of Symbolic Logic, 5:56–68, 1940.

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Owre et al. PVS: Combining specification, proof checking and model checking. In Proc. of CAV-96, LNCS 1102. Springer, 1996.

    Google Scholar 

  10. A. Fiedler. P.rex: An interactive proof explainer. In Proc. of IJCAR 2001, LNAI 2083. Springer, 2001.

    Google Scholar 

  11. M. Kohlhase and J. Zimmer. System description: The MathWeb Software Bus for Distributed Mathmatical Reasoning. In Proc. of CADE-18, LNAI. Springer, 2002.

    Google Scholar 

  12. A. Franke and M. Kohlhase. System description: MBase, an open mathematical knowledge base. In Proc. of CADE-17, LNAI 1831. Springer, 2000.

    Google Scholar 

  13. M. Gordon and T. Melham. Introduction to HOL-A theorem proving environment for higher order logic. Cambridge University Press, 1993.

    Google Scholar 

  14. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94-6, Argonne National Laboratory, Argonne, Illinois 60439, USA, 1994.

    Google Scholar 

  15. A. Meier. TRAMP: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level. In Proc. of CADE-17, LNAI 1831. Springer, 2000.

    Google Scholar 

  16. A. Meier, M. Pollet, and V. Sorge. Comparing Approaches to Explore the Domain of Residue Classes. Journal of Symbolic Computations, 2002. forthcoming.

    Google Scholar 

  17. E. Melis and A. Meier. Proof Planning with Multiple Strategies. In Proc. of CL-2000, LNAI 1861. Springer, 2000.

    Google Scholar 

  18. E. Melis and J. Siekmann. Knowledge-Based Proof Planning. Artificial Intelligence, 115(1):65–105, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  19. E. Melis, J. Zimmer, and T. Müller. Integrating constraint solving into proof planning. In Proc. of FroCoS 2000, LNAI 1794. Springer, 2000.

    Google Scholar 

  20. J.D.C Richardson, A. Smaill, and I.M. Green. System description: Proof planning in higher-order logic with λ-CLAM. In Proc. of CADE-15, LNAI 1421, Springer, 1998.

    Google Scholar 

  21. J. Siekmann et al. \( \mathcal{L}\mathcal{O}\mathcal{U}\mathcal{I}{\text{: }}\mathcal{L}{\text{ovely}} \) Ωmega \( \mathcal{U}{\text{ser }}\mathcal{I}{\text{nterface}} \). Formal Aspects of Computing, 11:326–342, 1999.

    Article  Google Scholar 

  22. V. Sorge. Non-Trivial Computations in Proof Planning. In Proc. of FroCoS 2000, LNAI 1794. Springer, 2000.

    Google Scholar 

  23. Coq Development Team. The Coq Proof Assistant Reference Manual. INRIA. see http://coq.inria.fr/doc/main.html.

Download references

Author information

Author notes

  1. Michael Kohlhase

    Present address: Carnegie Mellon University, Pittsburgh, PA, USA

  2. Volker Sorge

    Present address: University of Birmingham, Birmingham, UK

Authors and Affiliations

  1. FR 6.2 Informatik, Universität des Saarlandes, 66041, Saarbrücken, Germany

    Jörg Siekmann, Christoph Benzmüller, Vladimir Brezhnev, Lassaad Cheikhrouhou, Armin Fiedler, Andreas Franke, Helmut Horacek, Michael Kohlhase, Andreas Meier, Erica Melis, Markus Moschner, Immanuel Normann, Martin Pollet, Volker Sorge, Carsten Ullrich, Claus-Peter Wirth & Jürgen Zimmer

Authors
  1. Jörg Siekmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Benzmüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimir Brezhnev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lassaad Cheikhrouhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Armin Fiedler
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andreas Franke
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Helmut Horacek
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Michael Kohlhase
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Andreas Meier
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. Erica Melis
    View author publications

    You can also search for this author in PubMed Google Scholar

  11. Markus Moschner
    View author publications

    You can also search for this author in PubMed Google Scholar

  12. Immanuel Normann
    View author publications

    You can also search for this author in PubMed Google Scholar

  13. Martin Pollet
    View author publications

    You can also search for this author in PubMed Google Scholar

  14. Volker Sorge
    View author publications

    You can also search for this author in PubMed Google Scholar

  15. Carsten Ullrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  16. Claus-Peter Wirth
    View author publications

    You can also search for this author in PubMed Google Scholar

  17. Jürgen Zimmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Rd, Manchester, M13 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siekmann, J. et al. (2002). Proof Development with Ωmega . In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45620-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43931-8

  • Online ISBN: 978-3-540-45620-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation