Ωmega: Computer supported mathematics

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

Volumn 3238 LNAI, Issue , 2004, Pages 3-28

  Siekmann, Jörg ^a   Benzmüller, Christoph ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; AUTOMATION; BIOMINERALIZATION; DIGITAL ARITHMETIC;

COMPUTER ALGEBRA SYSTEMS; LEVEL OF ABSTRACTION; MATHEMATICAL PROBLEMS; MATHEMATICAL REASONING; PLANNING TECHNIQUES; PRESBURGER ARITHMETIC; PROOF PLANNING SYSTEM; RESEARCH COMMUNITIES; INTEGRATED RESEARCH;

THEOREM PROVING;

EID: 33750449034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30221-6_2     Document Type: Conference Paper

References (99)

1. [ABB00] P.B. Andrews, M. Bishop, and C.E. Brown. System description: TPS: A theorem proving system for type theory. In Conference on Automated Deduction, pages 164-169, 2000.
2. +03] S. Autexier, C. Benzmüller, A. Fiedler, H. Horacek, and Q. Bao Vo. Assertion-level proof representation with under-specification. Electronic in Theoretical Computer Science, 93:5-23, 2003.
3. +96] P.B. Andrews, M. Bishop, S. Issar, D. Nesmith, F. Pfenning, and H. Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3):321-353, 1996.
4. +00] S. Allen, R. Constable, R. Eaton, C. Kreitz, and L. Lorigo. The Nuprl open logical environment. In McAllester [McA00].
5. [AH02] S. Autexier and D. Hutter. Maintenance of formal software development by stratified verification. In M. Baaz and A. Voronkov, editors, Proceedings of LPAR'02, LNCS, Tbilissi, Georgia, September 2002. Springer.
6. [AHMS02] S. Autexier, D. Hutter, T. Mossakowski, and A. Schairer. The development graph manager MAYA. In H. Kirchner and C. Ringeissen, editors, Proceedings 9th International Conference on Algebraic Methodology And Software Technology (AMAST'02), volume 2422 of LNCS. Springer, September 2002.
7. [AM02] S. Autexier and T. Mossakowski. Integrating HOL-CASL into the development graph manager MAYA. In A. Armando, editor, Proceedings of FROCOS'02, volume 2309 of LNAI, pages 2-17. Springer, April 2002.
8. [Aut03] S. Autexier. Hierarchical Contextual Reasoning. PhD thesis, Computer Science Department, Saarland University, Saarbru ̈cken, Germany, 2003. forthcoming.
9. [BBS99] C. Benzmüller, M. Bishop, and V. Sorge. Integrating TPS and Ωmega. Journal of Universal Computer Science, 5:188-207, 1999.
10. [Ben99] C. Benzmüller. Equality and Extensionality in Higher-Order Theorem Proving. PhD thesis, Department of Computer Science, Saarland University, Saarbrücken, Germany, 1999.
11. [BF94] P. Baumgartner and U. Furbach. PROTEIN, a PROver with a Theory INterface. In Bundy [Bun94], pages 769-773.
12. +03] C. Benzmüller, A. Fiedler, M. Gabsdil, H. Horacek, I. Kruijff-Korbayova, M. Pinkal, J. Siekmann, D. Tsovaltzi, B. Quoc Vo, and M. Wolska. Tutorial dialogs on mathematical proofs. In Proceedings of IJCAI-03 Workshop on Knowledge Representation and Automated Reasoning for E-Learning Systems, pages 12-22, Acapulco, Mexico, 2003.
13. [BFMP02] C. Benzmüller, A. Fiedler, A. Meier, and M. Pollet. Irrationality of √2 - a case study in Ωmega. Seki-Report SR-02-03, Department of Computer Science, Saarland University, Saarbrücken, Germany, 2002.
14. [BGH03] B. Buchberger, G. Gonnet, and M. Hazewinkel. Special issue on mathematical knowledge management. Annals of Mathematics and Artificial Intelligence, 38(1-3):3-232, May 2003.
15. [BK98] C. Benzmüller and M. Kohlhase. LEO - a higher-order theorem prover. In Kirchner and Kirchner [KK98].
16. [Ble90] W. Bledsoe. Challenge problems in elementary calculus. Journal of Automated Reasoning, 6:341-359, 1990.
17. [BMS04] C. Benzmüller, A. Meier, and V. Sorge. Bridging theorem proving and mathematical knowledge retrieval. In Hutter and Stephan [HS04]. To appear.
18. [Bou68] N. Bourbaki. Theory of sets. In Elements of Mathematics, volume 1. Addison-Wesley, 1968.
19. [BS82] R. Bartle and D. Sherbert. Introduction to Real Analysis. Wiley, 2nd edition, 1982.
20. [BS98] C. Benzmüller and V. Sorge. A blackboard architecture for guiding interactive proofs. In Giunchiglia [Giu98].
21. [BS99] Christoph Benzmüller and Volker Sorge. Critical agents supporting interactive theorem proving. In Pedro Borahona and Jose J. Alferes, editors, Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA'99), number 1695 in LNAI, pages 208-221, Evora, Portugal, 1999. Springer.
22. [BS00] C. Benzmüller and V. Sorge. Ωants - An open approach at combining Interactive and Automated Theorem Proving. In Kerber and Kohlhase [KK00].
23. [Bun88] A. Bundy. The use of explicit plans to guide inductive proofs. In Lusk and Overbeek [LO88], pages 111-120.
24. [Bun91] A. Bundy. A science of reasoning. In G. Plotkin J.-L. Lasser, editor, Computational Logic: Essays in Honor of Alan Robinson, pages 178-199. MIT Press, 1991.
25. [Bun94] A. Bundy, editor. Proceedings of the 12th Conference on Automated Deduction, number 814 in LNAI. Springer, 1994.
26. [Bun02] A. Bundy. A critique of proof planning. In Computational Logic: Logic Programming and Beyond, number 2408 in LNCS, pages 160-177. Springer, 2002.
27. [BvHHS90] A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam System. In M. Stickel, editor, Proceedings of the 10th Conference on Automated Deduction, number 449 in LNCS, pages 647-648, Kaiserslautern, Germany, 1990. Springer.
28. +92] J. Carbonell, J. Blythe, O. Etzioni, Y. Gil, R. Joseph, D. Kahn, Craig. Knoblock, S. Minton, M. A. Pérez, S. Reilly, M. Veloso, and X. Wang. PRODIGY 4.0: The Manual and Tutorial. CMU Technical Report CMUCS-92-150, Carnegie Mellon University, June 1992.
29. +92] B. Char, K. Geddes, G. Gonnet, B. Leong, M. Monagan, and S. Watt. First leaves: a tutorial introduction to Maple V. Springer, 1992.
30. [Chu40] A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5:56-68, 1940.
31. [Coq03] Coq Development Team. The Coq Proof Assistant Reference Manual. INRIA, 1999-2003. See http://coq.inria.fr/doc/main.html.
32. [CS98] L. Cheikhrouhou and J. Siekmann. Planning diagonalization proofs. In Giunchiglia [Giu98], pages 167-180.
33. [CS00] L. Cheikhrouhou and V. Sorge. PDS - A Three-Dimensional Data Structure for Proof Plans. In Proceedings of the International Conference on Artificial and Computational Intelligence for Decision, Control and Automation in Engineering and Industrial Applications (ACIDCA'2000), Monastir, Tunisia, 22-24 March 2000.
34. [Dav65] M. Davis, editor. The Undecidable: Basic Papers on undecidable Propositions, unsolvable Problems and Computable Functions. Raven Press Hewlett, New York, 1965.
35. [Dav83] M. Davis. The prehistory and early history of automated deduction. In J. Siekmann and G. Wrightson, editors, Automation of Reasoning, volume 2 Classical Papers on Computational Logic 1967-1970 of Symbolic Computation. Springer, 1983.
36. [Dav01] M. Davis. The early history of automated deduction. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 1, pages 3-15. Elsevier Science, 2001.
37. [dN99] H. de Nivelle. Bliksem 1.10 user manual. Technical report, Max-Planck-Institut für Informatik, 1999.
38. [Dor01] The Doris system is available at http://www.cogsci.ed.ac.uk/ jbos/doris/, 2001.
39. [EHN94] K. Erol, J. Hendler, and D. Nau. Semantics for hierarchical task network planning. Technical Report CS-TR-3239, UMIACS-TR-94-31, Computer Science Department, University of Maryland, March 1994.
40. [Fie01a] A. Fiedler. Dialog-driven adaptation of explanations of proofs. In B. Nebel, editor, Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pages 1295-1300, Seattle, WA, 2001. Morgan Kaufmann.
41. [Fie01b] A. Fiedler. P.rex: An interactive proof explainer. In Goré et al. [GLN01].
42. [Fie01c] A. Fiedler. User-adaptive proof explanation. PhD thesis, Department of Computer Science, Saarland University, Saarbrücken, Germany, 2001.
43. [FK00a] A. Franke and M. Kohlhase. System description: MBase, an open mathematical knowledge base. In McAllester [McA00].
44. [FK00b] Andreas Franke and Michael Kohlhase. System description: Mbase, an open mathematical knowledge base. In David McAllester, editor, Automated Deduction, CADE-17 (CADE-00) : 17th International conference on Automated Deduction ; Pittsburgh, PA, USA, June 17-20, 2000, volume 1831 of Lecture notes in computer science. Springer, 2000.
45. [Gan99] H. Ganzinger, editor. Proceedings of the 16th Conference on Automated Deduction, number 1632 in LNAI. Springer, 1999.
46. [Geb99] H. Gebhard. Beweisplanung für die Beweise der Vollständigkeit verschiedener Resolutionskalküle in Ωmega. Master's thesis, Department of Computer Science, Saarland University, Saarbrücken, Germany, 1999.
47. [Giu98] F. Giunchiglia, editor. Proceedings of 8th International Conference on Arti-ficial Intelligence: Methodology, Systems, Applications (AIMSA'98), number 1480 in LNAI. Springer, 1998.
48. [GLN01] R. Goré, A. Leitsch, and T. Nipkow, editors. Automated Reasoning - 1st International Joint Conference, IJCAR 2001, number 2083 in LNAI. Springer, 2001.
49. [GM93] M. Gordon and T. Melham. Introduction to HOL - A theorem proving environment for higher order logic. Cambridge University Press, 1993.
50. [Had44] J. Hadamard. The Psychology of Invention in the Mathematical Field. Dover Publications, New York, USA; edition 1949, 1944.
51. [HJL99] Th. Hillenbrand, A. Jaeger, and B. Löchner. System description:Waldmeister - improvements in performance and ease of use. In Ganzinger [Gan99], pages 232-236.
52. [HS04] D. Hutter and W. Stephan, editors. Festschrift in Honour of Jörg Siekmann's 60s Birthday, LNAI. Springer, 2004. To appear.
53. [Hua94] X. Huang. Reconstructing Proofs at the Assertion Level. In Bundy [Bun94], pages 738-752.
54. [Hut00] D. Hutter. Management of change in structured verification. In Proceedings of Automated Software Engineering, ASE-2000. IEEE, 2000.
55. [KF01] M. Kohlhase and A. Franke. MBase: Representing knowledge and context for the integration of mathematical software systems. Journal of Symbolic Computation; Special Issue on the Integration of Computer Algebra and Deduction Systems, 32(4):365-402, September 2001.
56. [KK98] C. Kirchner and H. Kirchner, editors. Proceedings of the 15th Conference on Automated Deduction, number 1421 in LNAI. Springer, 1998.
57. [KK00] M. Kerber and M. Kohlhase, editors. 8th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus-2000). AK Peters, 2000.
58. [KR00] H. Kirchner and C. Ringeissen, editors. Frontiers of combining systems: Third International Workshop, FroCoS 2000, volume 1794 of LNAI. Springer, 2000.
59. [LO88] E. Lusk and R. Overbeek, editors. Proceedings of the 9th Conference on Automated Deduction, number 310 in LNCS, Argonne, Illinois, USA, 1988. Springer.
60. [MAH01] T. Mossakowski, S. Autexier, and D. Hutter. Extending development graphs with hiding. In Heinrich Hussmann, editor, Proceedings of Fundamental Approaches to Software Engineering (FASE 2001), number 2029 in LNCS, pages 269-283, Genova, April 2001. Springer.
61. [MB88] R. Manthey and F. Bry. SATCHMO: A theorem prover implemented in Prolog. In Lusk and Overbeek [LO88], pages 415-434.
62. [McA00] D. McAllester, editor. Proceedings of the 17th Conference on Automated Deduction, number 1831 in LNAI. Springer, 2000.
63. [McC94] W. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94-6, Argonne National Laboratory, Argonne, Illinois 60439, USA, 1994.
64. [McC97] W. McCune. Solution of the Robbins problem. Journal of Automated Reasoning, 19(3):263-276, 1997.
65. [Mei00] A. Meier. TRAMP: Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level. In McAllester [McA00].
66. [Mei03] A. Meier. Proof Planning with Multiple Strategies. PhD thesis, Department of Computer Science, Saarland University, Saarbrücken, Germany, 2003.
67. [Mel96] E. Melis. Island planning and refinement. Seki-Report SR-96-10, Department of Computer Science, Saarland University, Saarbrücken, Germany, 1996.
68. [Mel98a] E. Melis. AI-techniques in proof planning. In H. Prade, editor, Proceedings of the 13th European Conference on Artifical Intelligence, pages 494-498, Brighton, UK, 1998. John Wiley & Sons, Chichester, UK.
69. [Mel98b] E. Melis. AI-techniques in proof planning. In European Conference on Artificial Intelligence, pages 494-498, Brighton, 1998. Kluwer.
70. [MM00] E. Melis and A. Meier. Proof planning with multiple strategies. In J. Loyd, V. Dahl, U. Furbach, M. Kerber, K. Lau, C. Palamidessi, L.M. Pereira, Y. Sagivand, and P. Stuckey, editors, First International Conference on Computational Logic (CL-2000), number 1861 in LNAI, pages 644-659, London, UK, 2000. Springer.
71. [MMP02] A. Meier, E. Melis, and M. Pollet. Towards extending domain representations. Seki Report SR-02-01, Department of Computer Science, Saarland University, Saarbrücken, Germany, 2002.
72. [MPS01] A. Meier, M. Pollet, and V. Sorge. Classifying Isomorphic Residue Classes. In R. Moreno-Diaz, B. Buchberger, and J.-L. Freire, editors, A Selection of Papers from the 8th International Workshop on Computer Aided Systems Theory (EuroCAST 2001), number 2178 in LNCS, pages 494-508. Springer, 2001.
73. [MPS02] A. Meier, M. Pollet, and V. Sorge. Comparing Approaches to the Exploration of the Domain of Residue Classes. Journal of Symbolic Computation, Special Issue on the Integration of Automated Reasoning and Computer Algebra Systems, 34(4):287-306, October 2002. Steve Linton and Roberto Sebastiani, eds.
74. [MS99] E. Melis and J. Siekmann. Knowledge-based proof planning. Artificial Intelligence, 115(1):65-105, 1999.
75. [MS00] A. Meier and V. Sorge. Exploring properties of residue classes. In Kerber and Kohlhase [KK00].
76. [MZM00] E. Melis, J. Zimmer, and T. Müller. Integrating constraint solving into proof planning. In Kirchner and Ringeissen [KR00].
77. [NPW02] T. Nipkow, L.C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Number 2283 in LNCS. Springer, 2002.
78. +96] S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T. Henzinger, editors, Computer-Aided Verification, CAV '96, number 1102 in LNCS, pages 411-414, New Brunswick, NJ, 1996. Springer.
79. [Pau94] L. Paulson. Isabelle: A Generic Theorem Prover. Number 828 in LNCS. Springer, 1994.
80. [Pol73] G. Polya. How to Solve it. Princeton University Press, 1973.
81. [Rob65] J. A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. J. ACM 12(1): 23-41 (1965).
82. [RSG98] J. Richardson, A. Smaill, and I. Green. System description: Proof planning in higher-order logic with λClam. In Kirchner and Kirchner [KK98].
83. [RV01] A. Riazanov and A. Voronkov. Vampire 1.1 (system description). In Goré et al. [GLN01].
84. +95] M. Schönert et al. GAP - Groups, Algorithms, and Programming. Lehrstuhl D für Mathematik, Rheinisch Westfälische Technische Hochschule, Aachen, Germany, 1995.
85. +02] J. Siekmann, C. Benzmüller, A. Fiedler, A. Meier, and M. Pollet. Proof development with OMEGA: Sqrt(2) is irrational. In M. Baaz and A. Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, number 2514 in LNAI, pages 367-387. Springer, 2002.
86. +03] J. Siekmann, C. Benzmüller, A. Fiedler, A. Meier, I. Normann, and M. Pollet. Proof development in OMEGA: The irrationality of square root of 2. In F. Kamareddine, editor, Thirty Five Years of Automating Mathematics, Kluwer Applied Logic series (28), pages 271-314. Kluwer Academic Publishers, 2003. ISBN 1-4020-1656-5.
87. +99] J. Siekmann, S. Hess, C. Benzmüller, L. Cheikhrouhou, A. Fiedler, H. Horacek, M. Kohlhase, K. Konrad, A. Meier, E. Melis, M. Pollet, and V. Sorge. LOUI: Lovely Ωmega User Interface. Formal Aspects of Computing, 11:326-342, 1999.
88. [Sie92] J. Siekmann. Geschichte des automatischen beweisens (history of automated deduction). In Deduktionssysteme, Automatisierung des Logischen Denkens. R. Oldenbourg Verlag, 2nd edition, 1992. Also in English with Elsewood.
89. [Sie04] J. Siekmann. History of computational logic. In D. Gabbay and J. Woods, editors, The Handbook of the History of Logic, volume I-IX. Elsevier, 2004. To appear.
90. [Sor00] V. Sorge. Non-Trivial Computations in Proof Planning. In Kirchner and Ringeissen [KR00].
91. [Sor01] V. Sorge. ΩANTS - A Blackboard Architecture for the Integration of Reasoning Techniques into Proof Planning. PhD thesis, Department of Computer Science, Saarland University, Saarbrücken, Germany, 2001.
92. [SSY94] G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP problem library. In Bundy [Bun94].
93. [vdH01] J. van der Hoeven. GNU TeXmacs: A free, structured, wysiwyg and technical text editor. In Actes du congrès Gutenberg, number 39-40 in Actes du congrès Gutenberg, pages 39-50, Metz, May 2001.
94. [Vor02] A. Voronkov, editor. Proceedings of the 18th International Conference on Automated Deduction, number 2392 in LNAI. Springer, 2002.
95. +99] C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, Th. Engel, E. Keen, C. Theobalt, and D. Topic. System description: SPASS version 1.0.0. In Ganzinger [Gan99], pages 378-382.
96. [Wel94] D. Weld. An introduction to least commitment planning. AI Magazine, 15(4):27-61, 1994.
97. [Wie02] F. Wiedijk. The fifteen provers of the world. Unpublished Draft, 2002.
98. [ZK02] J. Zimmer and M. Kohlhase. System description: The Mathweb Software Bus for distributed mathematical reasoning. In Voronkov [Vor02], pages 138-142.
99. [ZZ95] J. Zhang and H. Zhang. SEM: A system for enumerating models. In C. S. Mellish, editor, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pages 298-303, Montreal, Canada, 1995. Morgan Kaufmann, San Mateo, California, USA.