We propose an extension of the tableau-based first order automated theorem prover Zenon to deduction modulo, which allows us to transform axioms into rewrite rules.Expand

We present a shallow embedding into Dedukti of proofs produced by Zenon Modulo, an extension of the tableau-based first-order theorem prover Zenon to deduction modulo and typing.Expand

Dedukti is a Logical Framework based on the λΠ-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory,… Expand

Defining a theory, such as arithmetic, geometry, or set theory, in predicate logic just requires to chose function and predicate symbols and axioms, that express the meaning of these symbols.Expand

We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verication of proof obligations in the framework of theBWare project.Expand

We present the certifying part of the Zenon Modulo automated theorem prover, which is an extension of the Zenon tableau-based first order automated theorem prover to deduction modulo. The theory of… Expand

A theory, commonly formulated as a collection of axioms, is often necessary to specify, in a concise and understandable way, the properties of objects manipulated in software proofs.Expand

We introduce a new encoding of the set theory of the B method based on deduction modulo. The theory of deduction modulo is an extension of predicate calculus that includes rewriting on both terms and… Expand

We introduce a first-order sequent calculus extended with a polymorphic type system, which is in particular the output proof-format of the tableau-based automated theorem prover Zenon, and show that Zenon proofs can be translated to proofs of the initial B formulae in the B proof system.Expand