Proof development with Ωmega

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

Volumn 2392, Issue , 2002, Pages 144-149

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

^a SAARLAND UNIVERSITY   (Germany)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84948980176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_12     Document Type: Conference Paper

References (23)

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.
2. C. Benzmüller et al. Ωmega: Towards a mathematical assistant. In Proc. of CADE-14, LNAI 1249. Springer, 1997.
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.
4. W.W. Bledsoe. Challenge problems in elementaryanaly sis. Journal of Automated Reasoning, 6:341–359, 1990.
5. A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In Proc. of CADE-9, LNCS 310. Springer, 1988.
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.
7. L. Cheikhrouhou and V. Sorge. PDS — A Three-Dimensional Data Structure for Proof Plans. In Proc. of ACIDCA’2000, 2000.
8. A. Church. A Formulation of the Simple Theoryof Types. The Journal of Symbolic Logic, 5:56–68, 1940.
9. S. Owre et al. PVS: Combining specification, proof checking and model checking. In Proc. of CAV-96, LNCS 1102. Springer, 1996.
10. A. Fiedler. P.rex: An interactive proof explainer. In Proc. of IJCAR 2001, LNAI 2083. Springer, 2001.
11. M. Kohlhase and J. Zimmer. System description: The MathWeb Software Bus for Distributed Mathmatical Reasoning. In Proc. of CADE-18, LNAI. Springer, 2002.
12. A. Franke and M. Kohlhase. System description: MBase, an open mathematical knowledge base. In Proc. of CADE-17, LNAI 1831. Springer, 2000.
13. M. Gordon and T. Melham. Introduction to HOL – A theorem proving environment for higher order logic. Cambridge UniversityPress, 1993.
14. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94-6, Argonne National Laboratory, Argonne, Illinois 60439, USA, 1994.
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.
16. A. Meier, M. Pollet, and V. Sorge. Comparing Approaches to Explore the Domain of Residue Classes. Journal of Symbolic Computations, 2002. forthcoming.
17. E. Melis and A. Meier. Proof Planning with Multiple Strategies. In Proc. of CL-2000, LNAI 1861. Springer, 2000.
18. E. Melis and J. Siekmann. Knowledge-Based Proof Planning. Artificial Intelligence, 115(1):65–105, 1999.
19. E. Melis, J. Zimmer, and T. Müller. Integrating constraint solving into proof planning. In Proc. of FroCoS 2000, LNAI 1794. Springer, 2000.
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.
21. J. Siekmann et al. LOUI: LovelyΩ mega User Interface. Formal Aspects of Computing, 11:326–342, 1999.
22. V. Sorge. Non-Trivial Computations in Proof Planning. In Proc. of FroCoS 2000, LNAI 1794. Springer, 2000.
23. Coq Development Team. The Coq Proof Assistant Reference Manual. INRIA. see http://coq.inria.fr/doc/main.html.