Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Applied Logic Year : 2012

Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems

Abstract

We present a procedure for checking sufficient completeness of conditional and constrained term rewriting systems containing axioms for constructors which may be constrained (by e.g. equalities, disequalities, ordering, membership...). Such axioms allow to specify complex data structures like e.g. sets, sorted lists or powerlists. Our approach is integrated into a framework for inductive theorem proving based on tree grammars with constraints, a formalism which permits an exact representation of languages of ground constructor terms in normal form. The procedure is presented by an inference system which is shown sound and complete. A precondition of one inference of this system refers to a (undecidable) property called strong ground reducibility which is discharged to the above inductive theorem proving system. We have successfully applied our method to several examples, yielding readable proofs and, in case of negative answer, a counter-example suggesting how to complete the specification. Moreover, we show that it is a decision procedure when the TRS is unconditional but constrained, for an expressive class of constrained constructor axioms.
Fichier principal
Vignette du fichier
completeness-long.pdf (272.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00643136 , version 1 (21-11-2011)

Identifiers

Cite

Adel Bouhoula, Florent Jacquemard. Sufficient Completeness Verification for Conditional and Constrained Term Rewriting Systems. Journal of Applied Logic, 2012, 10 (1), pp.127-143. ⟨10.1016/j.jal.2011.09.001⟩. ⟨hal-00643136⟩
140 View
238 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More