@inproceedings{c56ef525751c4c6eb3deb9ed54758ac1,

title = "On composable properties of term rewriting systems",

abstract = "A property of term rewriting system (TRS, for short) is said to be composable if it is preserved under unions. We present composable properties of TRSs on the base of modularity results for direct sums of TRSs. We propose a decomposition by a naive sort attachment, and show that modular properties for direct sums of TRSs are τ-composable for a naive sort attachment τ. Here, a decomposition of a TRS R is a pair (R 1,R 2) of (not necessary disjoint) subsets of R such that R = R 1 U R 2; and for a naive sort attachment T a property {\o} of TRSs is said to be τ-composable if for any TRS R such that τ is consistent withR, {\o}(R1) Λ φ(R2) implies φ(R) where (R 1, R 2) is the decomposition of R by τ.",

author = "Takahito Aoto and Yoshihito Toyama",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/BFb0027006",

language = "English",

isbn = "3540634592",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "114--128",

editor = "Karl Meinke and Michael Hanus and Jan Heering",

booktitle = "Algebraic and Logic Programming - 6th International Joint Conference ALP 1997 ― HOA 1997, Proceedings",

note = "6th International Conference on Algebraic and Logic Programming, ALP 1997 ; Conference date: 03-09-1997 Through 05-09-1997",

}