Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies

Florent Jacquemard 1, 2 Yoshiharu Kojima 3 Masahiko Sakai 4
1 Repmus - Représentations musicales
STMS - Sciences et Technologies de la Musique et du Son
2 MuTant - Synchronous Realtime Processing and Programming of Music Signals
Inria Paris-Rocquencourt, UPMC - Université Pierre et Marie Curie - Paris 6, IRCAM, CNRS - Centre National de la Recherche Scientifique
Abstract : We consider the extension of term rewriting rules with context constraints restricting the application of rewriting to positions whose prefix (i.e. the sequence of symbols from the rewrite position up to the root) belongs to a given regular language. This approach, well studied in the case of string rewriting, is similar to node selection mechanisms in XML transformation languages, and also generalizes the context-sensitive rewriting. The systems defined this way are called prefix constrained TRS (pCTRS), and we study the decidability of reachability of regular tree model checking and the preservation of regularity for some subclasses. The two latter properties hold for linear and right-shallow standard TRS but not any-more when adding context constraints. We show that these properties can be restored by restricting derivations to bottom-up ones, and moreover that it implies that left-linear and right-ground pCTRS preserve regularity and have a decidable regular model checking problem.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01149319
Contributor : Florent Jacquemard <>
Submitted on : Wednesday, May 13, 2015 - 6:32:45 PM
Last modification on : Thursday, March 21, 2019 - 1:10:10 PM
Document(s) archivé(s) le : Thursday, April 20, 2017 - 12:00:20 AM

File

pCTRS-bu.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01149319, version 2

Citation

Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai. Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. 25th International Conference on Automated Deduction (CADE’15), Aug 2015, Berlin, Germany. ⟨hal-01149319v2⟩

Share

Metrics

Record views

230

Files downloads

196