Persistency of Connuence 1
نویسندگان
چکیده
A property P of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS R, R has the property P if and only if its underlying unsorted TRS (R) has the property P. This notion was introduced by H. Zantema (1994). In this paper, it is shown that con uence is persistent.
منابع مشابه
الگــوهای فضــایی اهمیـت تــداوم بــارش ایــران
Iran is located in dry zone of mid-latitude in which the mean rainfall is 250 mm and it has dramatic tempo-spatial changes. Rainfalls with short persistency are of characteristics of dry regions and it is also tangible in Iran. However, Iran’s rainfalls persistency ranges from 1 to 45 days and have dramatic tempo-spatial changes, but the maximum amount and days of rainfalls are supplied by rain...
متن کاملSyntactic Connuence Criteria for Positive/negative-conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing connuence of unconditional or conditional term rewriting systems into practically more useful connuence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet's introduction and Toyama's generalization of parallel closedness for non-noetherian unconditional systems, t...
متن کاملOn Connuence of Constraint Handling Rules on Connuence of Constraint Handling Rules
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کاملConnuence by Decreasing Diagrams
We present a connuence criterion, local decreasingness, for abstract reduction systems. This criterion is shown to be a considerable generalisation of several well-known connuence criteria.
متن کاملOn Con uence of Constraint Handling
We introduce the notion of connuence for Constraint Handling Rules (CHR), a powerful language for writing constraint solvers. With CHR one simpliies and solves constraints by applying rules. Connuence guarantees that a CHR program will always compute the same result for a given set of constraints independent of which rules are applied. We give a decidable, suucient and necessary syntactic condi...
متن کامل