On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems

We study (un)soundness of transformations of conditional term rewriting systems (CTRSs) into unconditional term rewriting systems (TRSs). The focus here is on analyzing (un)soundness of so-called unravelings, the most basic and natural class of such transformations. We extend our previous analysis from normal 1-CTRSs to the more general class of deterministic CTRSs (DCTRSs) where extra variables in right-hand sides of rules are allowed to a certain extent. We prove that the previous soundness results based on weak left-linearity and on right-linearity can be extended from normal 1-CTRSs to DCTRSs. Counterexamples show that such an extension to DCTRSs does not work for the previous criteria which were based on confluence and on nonerasingness, not even for right-stable systems. Yet, we prove weaker versions of soundness criteria based on confluence and on non-erasingness. Finally, we compare our approach and results with other recently established soundness criteria for unraveling DCTRSs. 1998 ACM Subject Classification F.1.1 Models of Computation

[1]  Francisco Durán,et al.  Proving operational termination of membership equational programs , 2008, High. Order Symb. Comput..

[2]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[3]  Bernhard Gramlich,et al.  Characterizing and proving operational termination of deterministic conditional term rewriting systems , 2010, J. Log. Algebraic Methods Program..

[4]  Enno Ohlebusch,et al.  Advanced Topics in Term Rewriting , 2002, Springer New York.

[5]  Bernhard Gramlich,et al.  Transformations of Conditional Rewrite Systems Revisited , 2009, WADT.

[6]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[7]  Bernhard Gramlich,et al.  On (Un)Soundness of Unravelings , 2010, RTA.

[8]  Taro Suzuki,et al.  Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides , 1995, RTA.

[9]  Francisco Durán,et al.  Proving termination of membership equational programs , 2004, PEPM '04.

[10]  Nachum Dershowitz,et al.  Logic Programming cum Applicative Programming , 1985, SLP.

[11]  Jürgen Avenhaus,et al.  On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs , 1994, LPAR.

[12]  Masahiko Sakai,et al.  Completion after Program Inversion of Injective Functions , 2009, WRS@RTA.

[13]  Masahiko Sakai,et al.  Partial Inversion of Constructor Term Rewriting Systems , 2005, RTA.

[14]  Nishida Naoki,et al.  On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems , 2004 .

[15]  Masahiko Sakai,et al.  Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity , 2011, RTA.

[16]  Massimo Marchiori,et al.  On Deterministic Conditional Rewriting , 1997 .

[17]  Massimo Marchiori,et al.  Unravelings and Ultra-properties , 1996, ALP.

[18]  Patrick Viry,et al.  Elimination of Conditions , 1995, J. Symb. Comput..