On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations

Abstract

We investigate the word and the subsumption problem for recurrent term schematizations, which are a special type of constraints based on iteration. By means of unification, we reduce these problems to a fragment of Presburger arithmetic. Our approach is applicable to all recurrent term schematizations having a finitary unification algorithm. Furthermore, we study a particular form of the complement problem. Given a finite set of terms, we ask whether its complement can be finitely represented by schematizations, using only the equality predicate without negation. The answer is negative as there are ground terms too complex to be represented by schematizations with limited resources.
Fichier principal
Vignette du fichier
98-R-020.pdf (224.09 Ko) Télécharger le fichier

Dates and versions

inria-00098687 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098687 , version 1

Cite

Miki Hermann, Gernot Salzer. On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. 23nd International Conference on Mathematical Foundations of Computer Science, 1998, Brno, République Tchèque, pp.257-266. ⟨inria-00098687⟩
86 View
107 Download

Share

Gmail Facebook Twitter LinkedIn More