KI 2004: Advances in Artificial Intelligence

The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proof-checked by a computer. Classical theorem proving procedures of today are based on ingenious search techniques to find a proof for a given theorem in very large search spaces – often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to more abstract planning techniques however opened up a new paradigm for mathematical reasoning on a computer and several systems of the new kind now employ a mix of interactive, search based as well as proof planning techniques. The Ωmega system is at the core of several related and well-integrated research projects of the Ωmega research group, whose aim is to develop system support for the working mathematician, in particular it supports proof development at a human oriented level of abstraction. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. Ωmega has many characteristics in common with systems like NuPrL [ACE00], CoQ [Coq03], Hol [GM93], Pvs [ORR96], and Isabelle [Pau94,NPW02]. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems Clam and λClam at Edinburgh [RSG98,BvHHS90]. 1 http://www.win.tue.nl/automath/ S. Biundo, T. Frühwirth, and G. Palm (Eds.): KI 2004, LNAI 3238, pp. 3–28, 2004. c © Springer-Verlag Berlin Heidelberg 2004 4 Jörg Siekmann and Christoph Benzmüller

[1]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[4]  Jussi Karlgren,et al.  Recognizing Text Genres With Simple Metrics Using Discriminant Analysis , 1994, COLING.

[5]  G. Sutcliffe,et al.  The TPTP Problem Library, Release v1.2.0 , 1995 .

[6]  Hinrich Schütze,et al.  Automatic Detection of Text Genre , 1997, ACL.

[7]  Erica Melis,et al.  AI-Techniques in Proof Planning , 1998, ECAI.

[8]  Volker Sorge,et al.  L UI : L ovely MEGA U ser I nterface. , 1999 .

[9]  A. Meier,et al.  Proof Planning with Multiple Strategies II , 1999 .

[10]  Kevin Crowston,et al.  The effects of linking on genres of Web documents , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[11]  Michael Kohlhase,et al.  System Description: MBASE, an Open Mathematical Knowledge Base , 2000, CADE.

[12]  Efstathios Stamatatos,et al.  Text Genre Detection Using Common Word Frequencies , 2000, COLING.

[13]  Erica Melis,et al.  Integrating Constraint Solving into Proof Planning , 2000, FroCoS.

[14]  Carol Van Ess-Dykema,et al.  The Form is the Substance: Classification of Genres in Text , 2001, HTLKM@ACL.

[15]  A. Meier,et al.  Exploring properties of residue classes , 2001 .

[16]  Kevin Crowston,et al.  Genre based navigation on the Web , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[17]  Dieter Hutter,et al.  Extending Development Graphs with Hiding , 2001, FASE.

[18]  Michael Kohlhase,et al.  MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems , 2001, J. Symb. Comput..

[19]  Michael Kohlhase,et al.  System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning , 2002, CADE.

[20]  Sung-Hyon Myaeng,et al.  Text genre classification with genre-revealing and subject-revealing features , 2002, SIGIR '02.

[21]  Volker Sorge,et al.  Comparing Approaches to the Exploration of the Domain of Residue Classes , 2002, J. Symb. Comput..

[22]  Georg Rehm.  Towards Automatic Web Genre Identification , 2002, HICSS.

[23]  Aidan Finn,et al.  Learning to classify documents according to genre , 2006, J. Assoc. Inf. Sci. Technol..