Filter Results:
- Full text PDF available (144)
Publication Year
1968
2018
- This year (13)
- Last 5 years (57)
- Last 10 years (100)
Publication Type
Co-author
Journals and Conferences
Learn More
LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers for natural fragments of higher-order logic. At present LEO-II can… (More)
- Christoph Benzmüller, Michael Kohlhase
- CADE
- 1998
Many (mathematical) problems, such as Cantor’s theorem, can be expressed very elegantly in higher-order logic, but lead to an exhaustive and un-intuitive formulation when coded in first-order logic.… (More)
- Christoph Benzmüller, Florian Rabe, Geoff Sutcliffe
- IJCAR
- 2008
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This paper introduces the… (More)
Classical automated theorem proving of today is based on ingenious search techniques a proof for a given theorem in very large search spaces—often in the range of several billion c But in spite of… (More)
- Christoph Benzmüller, Lawrence C. Paulson
- Logica Universalis
- 2013
We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. A correspondence between QKπ models for quantified multimodal logics and… (More)
Kurt Gödel’s ontological argument for God’s existence has been formalized and automated on a computer with higher-order automated theorem provers. From Gödel’s premises, the computer proved:… (More)
- Christoph Benzmüller, Armin Fiedler, +7 authors Magdalena Wolska
- 2003
In this paper we report on a Wizard-of-Oz (WOz) experiment which was conducted in order to collect written empirical data on mathematics tutorial dialogues in German. We present a methodological… (More)
- Serge Autexier, Christoph Benzmüller, Armin Fiedler, Helmut Horacek, Quoc Bao Vo
- Electr. Notes Theor. Comput. Sci.
- 2004
We propose a proof representation format for human-oriented proofs at the assertion level with underspecification. This work aims at providing a possible solution to challenging phenomena worked out… (More)
- Geoff Sutcliffe, Christoph Benzmüller
- J. Formalized Reasoning
- 2010
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well known and well established infrastructure that supports research, development, and deployment of Automated… (More)
- J. Siekmann, Christoph Benzmüller, +13 authors Claus-Peter Wirth
- 2002
The Ωmega proof development system [2] is the core of several related and well integrated research projects of the Ωmega research group. Ωmega is a mathematical assistant tool that supports proof… (More)