#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1995

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We present a new data structure that enables to store three-dimensional proof objects in a proof development environment. The aim is to handle calculus level proofs as well as abstract proof plans together with information of their correspondences in a single structure. This enables not only different means of the proof development environment (e.g.,… (More)

- Vladimir Brezhnev, Lassaad Cheikhrouhou, +10 authors Markus Mos hner
- 2002

- Lassaad Cheikhrouhou, Detlef Fehrer, +8 authors Volker Sorge
- 1997

mega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an integrated collection of tools for formulating problems, proving subproblems, and proof presentation.

- Jörg H. Siekmann, Stephan M. Hess, +9 authors Volker Sorge
- Formal Aspects of Computing
- 1999

The capabilities of a automated theorem prover's interface are essential for the effective use of (interactive) proof systems. LΩUI is the multi-modal interface that combines several features: a graphical display of information in a proof graph, a selective term browser with hypertext facilities, proof and proof plan presentation in natural language, and an… (More)

- Christoph Benzmüller, Lassaad Cheikhrouhou, +10 authors Volker Sorge
- CADE
- 1997

- Jörg H. Siekmann, Christoph Benzmüller, +14 authors Jürgen Zimmer
- CADE
- 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 development in mathematical domains at a user-friendly level of abstraction. It is a modular system with a central data structure and several complementary… (More)

- Lassaad Cheikhrouhou
- KI
- 1997

Proof planning is a novel knowledge-based approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical eld. The diagonalization proof technique is a well-known method in theoretical computer science and in mathematics that originated with Can-tor, who… (More)

- Xiaorong Huang, Manfred Kerber, Lassaad Cheikhrouhou
- Annals of Mathematics and Artificial Intelligence
- 1998

The reasoning power of human-oriented plan-based reasoning systems is primarily derived from their domain-specific problem solving knowledge. Such knowledge is, however, intrinsically incomplete. In order to model the human ability of adapting existing methods to new situations we present in this work a declarative approach for representing methods, which… (More)

- Jörg Siekmann, Helmut Horacek, +9 authors V. Sorge
- 2000

Current semi-automated theorem provers are often advertised as “mathematical assistant systems”. However, these tools behave too passively and in a stereotypic way to meet this ambitious goal because they lack the capability to adequately take into account requirements on proof search control and user demands for their own actions. Motivated by this… (More)

- Lassaad Cheikhrouhou, Georg Rock, Werner Stephan, Matthias Schwan, Gunter Laßmann
- SAFECOMP
- 2006