Automatic Decidability and Combinability Revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Automatic Decidability and Combinability Revisited

Abstract

We present an inference system for clauses with ordering constraints, called Schematic Paramodulation. Then we show how to use Schematic Paramodulation to reason about decidability and stable infiniteness of finitely presented theories. We establish a close connection between the two properties: if Schematic Paramodulation for a theory halts then the theory is decidable; and if, in addition, Schematic Paramodulation does not derive the trivial equality X = Y then the theory is stably infinite. Decidability and stable infiniteness of component theories are conditions required for the Nelson-Oppen combination method. Schematic Paramodulation is loosely based on Lynch-Morawska's meta-saturation but it differs in several ways. First, it uses ordering constraints instead of constant constraints. Second, inferences into constrained variables are possible in Schematic Paramodulation. Finally, Schematic Paramodulation uses a special deletion rule to deal with theories for which Lynch-Morawska's meta-saturation does not halt.

Dates and versions

inria-00576605 , version 1 (14-03-2011)

Identifiers

Cite

Christopher Lynch, Duc-Khanh Tran. Automatic Decidability and Combinability Revisited. Automated Deduction - CADE-21, 2007, Bremen, Germany. pp.328-344, ⟨10.1007/978-3-540-73595-3_22⟩. ⟨inria-00576605⟩
78 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More