Computers arechanging the way wethink. Of course, nearly all desk-workers have access to
computers and use them to email their colleagues, search the Web for information and …

Unification is one of the key procedures in first-order theorem provers. Most first-order
theorem provers use the Robinson unification algorithm. Although its complexity is in the …

Classical automated theorem proving of today is based on ingenious search techniques to
find a proof for a given theorem in very large search spaces—often in the range of several …

Le calcul de réécriture est un lambda-calcul avec filtrage. Cette thèse est consacrée à
l'étude de systèmes de types pour ce calcul et à son utilisation dans le domaine de la …

We present a generic mediator, called PlatΩ, between text-editors and proof assistants.
PlatΩ aims at integrated support for the development, publication, formalization, and …

ΩMEGA: Resource-Adaptive Processes in an Automated Reasoning System Page 1 ΩMEGA:
Resource-Adaptive Processes in an Automated Reasoning System Serge Autexier, Christoph …

The lives of mathematical prodigies who passed away very early after groundbreaking work
invoke a fascination for later generations: The early death of Niels Henrik Abel (1802–1829) …

We present a proof step diagnosis module based on the mathematical assistant system
Ωmega. The task of this module is to evaluate proof steps as typically uttered by students in …

In this paper we investigate how to extract proof procedural information contained in
declarative representations of mathematical knowledge, such as axioms, definitions …

Abstract Ω MEGA [7], a mathematical assistant environment comprising an interactive proof
assistant, a proof planner, a structured knowledge base, a graphical user interface, access …