Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo

(1) , (2) , (3) , (1) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
Zenon-modulo-lpar-19.pdf (215.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00909784 , version 1 (26-12-2013)

Identifiers

Cite

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⟩
521 View
271 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More