#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2005

2018

- This year (2)
- Last 5 years (19)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Richard Bonichon, Olivier Hermant
- LPAR
- 2006

Deduction modulo is a theoretical framework designed to introduce computational steps in deductive systems. This approach is well suited to automated theorem proving and a tableau method forâ€¦ (More)

The Î»Î -calculus forms one of the vertices in Barendregtâ€™s Î»-cube and has been used as the core language for a number of logical frameworks. Following earlier extensions of natural deduction [14],â€¦ (More)

- Olivier Hermant
- TLCA
- 2005

Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzenâ€™s intuitionistic sequent calculus LJ, that relies on completeness ofâ€¦ (More)

We propose an extension of the tableau-based first order automated theorem prover Zenon to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us toâ€¦ (More)

- Olivier Hermant
- Journal of Automated Reasoning
- 2009

In this article, we show that the extension of the resolution proof system to deduction modulo is equivalent to the cut-free fragment of the sequent calculus modulo. The result is obtained through aâ€¦ (More)

- Richard Bonichon, Olivier Hermant
- TYPES
- 2006

Deduction modulo is a theoretical framework which allows the introduction of computational steps in deductive systems. This approach is well suited to automated theorem proving. We describe aâ€¦ (More)

- Ali Assaf, Guillaume Burel, +7 authors Ronan Saillard
- 2016

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching andâ€¦ (More)

- Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak
- OTM Workshops
- 2011

We introduce a new programming language called INI, which eases the development of self-adaptive software. INI combines both rulebased and event-based programming paradigms, by allowing theâ€¦ (More)

- Vivien Maisonneuve, Olivier Hermant, FranÃ§ois Irigoin
- Electr. Notes Theor. Comput. Sci.
- 2014

Using abstract interpretation, invariants are usually obtained by solving iteratively a system of equations linking preconditions according to program statements. However, it is also possible toâ€¦ (More)

We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verification of proof obligations in the framework of theâ€¦ (More)