Bernhard Gramlich  Home/Search
Context Related
| logic.at/staff/gramlich/p...tcs96.ps.gz loria.fr/pub/loria...amlichtcs96.ps.gz logic.tuwien.ac.at/people...tcs96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: logic.at/staff/gramlich/papers (more) From: logic.tuwien.ac.at/peopl...papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the modularity behaviour of termination and confluence properties of (join) conditional term rewriting systems. We give counterexamples showing that the properties weak termination, weak innermost termination and (strong) innermost termination are not preserved in general under signature extensions. Then we develop sufficient conditions for the preservation of these properties under signature extensions, and more generally, for their modularity in the disjoint union case. This... (Update)
Similar documents based on text: More All
0.2: Disjoint Elliptic Curves In A Projective Space - Chiantini, Cioffi, Orecchia (Correct)
0.1: On Termination and Confluence of Conditional Rewrite Systems - Gramlich (Correct)
0.1: Relating Innermost, Weak, Uniform and Modular Termination of.. - Gramlich (1993) (Correct)
BibTeX entry: (Update)
B. Gramlich. On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems. Theoritical Computer Science, 165(1):97--131, 1998. http://citeseer.ist.psu.edu/gramlich96termination.html More
@article{ gramlich96termination,
author = "Bernhard Gramlich",
title = "On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems",
journal = "Theoretical Computer Science",
volume = "165",
number = "1",
pages = "97--131",
year = "1996",
url = "citeseer.ist.psu.edu/gramlich96termination.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
474 Term rewriting systems - Klop - 1992
88 Computing in Systems Described by Equations (context) - O'Donnell - 1977
83 Counterexamples to termination for the direct sum of term re.. (context) - Toyama - 1987
79 the Church-Rosser property for the direct sum of term rewrit.. (context) - Toyama - 1987
73 Modularity of simple termination of term rewriting systems (context) - Kurihara, Ohuchi - 1990
73 Modularity of simple termination of term rewriting systems w.. (context) - Kurihara, Ohuchi - 1992
71 Conditional rewrite rules: confluence and termination (context) - Bergstra, Klop - 1986
63 Modular Properties of Term Rewriting Systems (context) - Middeldorp - 1990
59 On termination of the direct sum of term rewriting systems (context) - Rusinowitch - 1987
54 Tree-manipulating systems and Church-Rosser theorems (context) - Rosen - 1973
49 Modular properties of composable term rewriting systems - Ohlebusch - 1994
43 Theoretical Computer Science (context) - Kaplan, rules - 1984
41 the modularity of termination of term rewriting systems - Ohlebusch - 1994
38 Canonical conditional rewrite systems (context) - Dershowitz, Okada et al. - 1988
[Article contains additional citations not shown here]
Documents on the same site (http://www.logic.at/staff/gramlich/papers.html): More
A Constructor-Based Approach to Positive/Negative-Conditional .. - Wirth, Gramlich (1993) (Correct)
On Termination and Confluence of Conditional Rewrite Systems - Gramlich (Correct)
On Notions of Inductive Validity for First-Order Equational.. - Wirth, Gramlich (1994) (Correct)
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