Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo

Abstract : 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 rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms into rewrite rules. We also present a heuristic to perform this latter step automatically, and assess our approach by providing some experimental results obtained on the benchmarks provided by the TPTP library, where this heuristic is able to prove difficult problems in set theory in particular. Finally, we describe an additional backend for Zenon that outputs proof certificates for Dedukti, which is a proof checker based on the λΠ-calculus modulo.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00909784
Contributor : Damien Doligez <>
Submitted on : Thursday, December 26, 2013 - 7:00:04 AM
Last modification on : Saturday, February 9, 2019 - 1:22:57 AM
Long-term archiving on : Wednesday, March 26, 2014 - 10:05:17 PM

File

Zenon-modulo-lpar-19.pdf
Files produced by the author(s)

Identifiers

Citation

David Delahaye, Damien Doligez, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant. Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo. LPAR - Logic for Programming Artificial Intelligence and Reasoning - 2013, Dec 2013, Stellenbosch, South Africa. pp.274-290, ⟨10.1007/978-3-642-45221-5_20⟩. ⟨hal-00909784⟩

Share

Metrics

Record views

1142

Files downloads

318