@article{oai:nagoya.repo.nii.ac.jp:00007552,
 author = {Nishida, Naoki and Mizutani, Tomohiro and Sakai, Masahiko},
 journal = {Proceedings of 6th International Workshop on Reduction Strategies in Rewriting and Programming, Seattle, 2006},
 month = {},
 note = {Unravelings, which transform conditional term rewriting systems (CTRSs) into unconditional term rewriting systems, are useful for analyzing properties of CTRSs. To compute reduction sequences of CTRSs, the restriction by a particular context-sensitive and membership condition is imposed on reductions of the unraveled CTRSs. The condition is determined by extra function symbols introduced due to the unravelings. In this paper, we propose a method to weaken the restriction, that is, to reduce the number of extra symbols. We first improve the unraveling for deterministic CTRSs, and then propose a transformation that folds to two successively used rewrite rules in the unraveled CTRSs, which satisfy a condition, to a rewrite rule that simulates reductions by the two rules.},
 pages = {34--48},
 title = {Transformation for Refining Unraveled Conditional Term Rewriting Systems},
 year = {2007}
}