Detection of First Order Axiomatic Theories

Abstract : 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
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00919759
Contributor : Simon Cruanes <>
Submitted on : Tuesday, December 17, 2013 - 11:51:22 AM
Last modification on : Saturday, February 9, 2019 - 1:23:00 AM
Long-term archiving on : Monday, March 17, 2014 - 10:45:45 PM

File

theory_detection_free.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

256

Files downloads

253