| Ohlebusch, E. (1994c). Modular properties of constructor-sharing conditional term rewriting systems. |
....and Hamoen [18] for ensuring the completeness of narrowing in the presence of so called extra variables. Very few techniques are available for establishing level confluence of conditional systems, this in contrast to the confluence property for which several sufficient criteria are known, e.g. [2, 3, 6, 7, 11, 17, 20, 21, 22]. We only know of an early paper by Bergstra and Klop. In [3] they show that orthogonal normal conditional systems are level confluent. Actually they show confluence Giovannetti and Moiso [9] remark that the proof yields level confluence. Bergstra and Klop restrict the use of extra variables ....
E. Ohlebusch, Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems, Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems, Jerusalem, Lecture Notes in Computer Science, 1995. To appear.
....and Hamoen [18] for ensuring the completeness of narrowing in the presence of so called extra variables. Very few techniques are available for establishing level confluence of conditional systems, this in contrast to the confluence property for which several sufficient criteria are known, e.g. [2, 3, 6, 7, 11, 17, 20, 21, 22]. We only know of an early paper by Bergstra and Klop. In [3] they show that orthogonal normal conditional systems are level confluent. Actually they show confluence Giovannetti and Moiso [9] remark that the proof yields level confluence. Bergstra and Klop restrict the use of extra variables ....
E. Ohlebusch, Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems, Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems, Jerusalem, Lecture Notes in Computer Science, 1995. To appear.
.... completeness (i.e. termination plus confluence) and of other interesting properties of TRSs under disjoint combinations (cf. e.g. 30] 19] 33] 20] 14] 7] 8] 25] Non disjoint unions of TRSs with common constructors have been considered e.g. in [23] 15] 7] 8] 25] [27]. More general hierarchical combinations of TRSs have recently been dealt with in [17] 2] 18] 8] 6] Some preservation results for (disjoint and non disjoint, but non hierarchical) combinations of conditional TRSs (CTRSs for short) finally have been obtained in [20] 22] 21] 9] ....
.... for non overlapping CTRSs as well as for conditional overlay systems with joinable critical pairs (cf. Theorems 45, 46) ffl We show how to extend these modularity results to the (non disjoint) case of combined CTRSs with shared constructors by combining our analysis with recent results of [27] (cf. Theorems 62, 66 69) The rest of the paper is structured as follows. In the next section we shall introduce some necessary terminology. Then, in Section 3, we shall summarize results of [8] 10] on restricted and general termination and confluence properties of (C)TRSs. In the main Section ....
[Article contains additional citation context not shown here]
E. Ohlebusch, Modular properties of constructor-sharing conditional term rewriting systems, in: N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th Int. Workshop on Conditional and Typed Rewriting Systems (CTRS'94), Jerusalem, Israel, Lecture Notes in Computer Science, Vol. 968, (Springer, Berlin, 1995) 296--315.
....j 1 ) C b f Phi D b (s 1 ) Phi D b (s l Gamma1 ) Phi D b (u 1 ) Phi D b (u p ) Phi D b (s l 1 ) Phi D b (s m )g, where C b f; g = C b [ C b f; g; Now it is a consequence of s 0 l 2 Delta D b (s l ) 22 E. Ohlebusch that Phi D b (s 0 l ) occurs in the term Phi D b (s l ) and hence Phi D b (s l ) Sort(f Phi D b (u) j u 2 Delta D b (s l )g) h: Phi D b (s 0 l ) i CE Phi D b (s 0 l ) C b f Phi D b (u 1 ) Phi D b (u p )g: All in all, Phi D b (t j ) CE Phi D b (t ....
Ohlebusch, E. (1994c). Modular properties of constructor-sharing conditional term rewriting systems.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC