Detection of First Order Axiomatic Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Detection of First Order Axiomatic Theories


Automated theorem provers for first-order logic with equality have become very powerful and useful, thanks to both advanced calculi --- such as superposition and its refinements --- and mature implementation techniques. Nevertheless, dealing with some axiomatic theories remains a challenge because it gives rise to a search space explosion. Most attempts to deal with this problem have focused on specific theories, like AC (associative commutative symbols) or ACU (AC with neutral element). Even detecting the presence of a theory in a problem is generally solved in an ad-hoc fashion. We present here a generic way of describing and recognizing axiomatic theories in clausal form first-order logic with equality. Subsequently, we show some use cases for it, including a redundancy criterion that can be applied to some equational theories, extending some work that has been done by Avenhaus, Hillenbrand and Löchner
Fichier principal
Vignette du fichier
theory_detection_free.pdf (197.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00919759 , version 1 (17-12-2013)



Guillaume Burel, Simon Cruanes. Detection of First Order Axiomatic Theories. FroCoS - 9th International Symposium on Frontiers of Combining Systems - 2013, Sep 2013, Nancy, France. pp.229-244, ⟨10.1007/978-3-642-40885-4_16⟩. ⟨hal-00919759⟩
126 View
170 Download



Gmail Facebook Twitter LinkedIn More