N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-- 301, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Caching and Lemmaizing in Model Elimination - Theorem Provers Owen (Correct)
....ring problems by including the complete set of rewrite rules as demodulators as well as using demodulators generated during the search to rewrite all lemmas; we report on several successful applications in this area in Section 7. In the current system we use lexicographic recursive path ordering [10] based on a user specified total ordering of symbols to determine if a rewrite rule applies. The lexicographic order is also used to rewrite orientable instances of unorientable rules such as f(xy) f(yx) This system is similar to the LEX demodulators used in OTTER [25] and is a feature of the ....
....ordering of symbols to determine if a rewrite rule applies. The lexicographic order is also used to rewrite orientable instances of unorientable rules such as f(xy) f(yx) This system is similar to the LEX demodulators used in OTTER [25] and is a feature of the unfailing Knuth Bendix procedure [10]. The user may specify if a set of rewrite rules is to be used in addition to or independently of any dynamically generated demodulators. 6 Implementation Because cache templates and solutions must be added at runtime, it is not feasible to compile cache entries in the same way that input ....
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.
Proving Termination of AC-rewriting without Extended Rules - Borralleras, Rubio (Correct)
....termination proof harder. An alternative to the dependency pair method is the use of the monotonic semantic path ordering (MSPO; BFR00] which is a monotonic version of the semantic path ordering (SPO; KL80] The SPO generalizes path orderings like Dershowit s recursive path ordering (RPO; [Der82]) by replacing the use of a precedence by the use of any measure, defined by an underlaying quasi ordering, involving the whole term and not only the head symbol. The aim of this paper is to adapt the MSPO to deal with AC symbols, obtaining a fully monotonic AC ordering which allows us to avoid ....
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279--301, 1982. 40
On Semantic and Type-Theoretic - Aspects Of Polynomial-Time (Correct)
....is clear that most FP functions cannot be programmed in a non sizeincreasing framework, it has been shown by the same author [58] that all those representing problems in P can be. Returning to strati cation, Marion [92] applied the methodology to termination proofs using multiset path orderings [35]. Programs that can be proved to terminate by his light ordering compute exactly the FP functions. Before that FP was also characterized as a class of rst order programs admitting termination proofs by an appropriate assignment of polynomials with positive coecients to function symbols [23] to ....
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279-301, 1987.
The Decidability of the First-Order Theory of the.. - Korovin, Voronkov (Correct)
....Given such an order we can consider ordering constraints which are quanti er free formulas in the language of the term algebra with equality and the order. Two kinds of orders are mainly used in automated deduction: the Knuth Bendix orders [9] and various versions of the recursive path orders [5]. Because of its importance, the decision problem for ordering constraints has been well studied. For the recursive path orders decidability and complexity issues were considered in [8, 2, 16, 17, 15, 14] For the Knuth Bendix orders we have the following results: the decidability of constraints ....
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
Strong Normalization Proofs for Cut Elimination in Gentzen's.. - Bittar (Correct)
....E LK and we apply it in section 4.2 to prove a parallel moves lemma and hence the strong normalization for the orthogonal restrictions LKsp . Recursive path ordering monotone interpretations proofs This technique applies term rewriting recursive path ordering termination proofs developed in [Der82] and [KL80] it was used, building on Okada s lectures, in [CRS94] to prove the strong normalization of fragments of the linear calculus and in [CRS96] to prove strong normalization of ELK ; we apply it in section 4.3 to give a finite rewriting system interpretation of and hence a totally ....
....weak parallel moves lemma and the strong normalization property implies the confluence of E . 4.3. Strong normalization proofs by recursive path orderings In this section we describe and apply a recursive strong normalization criterion based on well partial order theory. We refer the reader to [Der82, KL80] for the initial studies on this subject or to [MZ94] for a new formulation of this matter. Strong normalization proofs for sequent calculi by recursive path orderings have been achieved in [CRS94, CRS96, DP96] A partial order on a set S, denoted by (S; is a non reflexive transitive binary ....
N. Dershowitz, Orderings for term rewriting systems, Theoretical Computer Science, Vol. 17 (5), 279-301.
Termination of Associative-Commutative Rewriting.. - Keiichirou.. (2002) (Correct)
....a given interpretation generates an AC compatible ordering, we have an ordering in varyadic terms, by interpreting varyadic terms into the interpretation of any non varyadic term it is equivalent to. 3. 2 Path orderings We assume the reader familiar with the Recursive Path Ordering with status [14, 22]. We use this ordering on flat terms by requiring that AC symbols always have multiset status. But such an ordering is not always monotonic: we need high restrictions on the precedence, as shown by the following proposition. Proposition 3.3 If all AC symbols are minimal in the precedence, then ....
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279--301, Mar. 1982.
WoLLIC 2003 Preliminary Version - For Self-citation (Dershowitz) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279--301, 1982.
Recursive Path Ordering for Infinite Labelled - Rewrite Systems Adam (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-- 301, 1982.
Certified Higher-Order Recursive Path Ordering Adam Koprowski - Eindhoven University Of (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-- 301, 1982.
TPA: Termination Proved Automatically - Adam Koprowski Technical (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-- 301, 1982.
Proving Liveness with Fairness using Rewriting - Koprowski, Zantema (2005) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-- 301, 1982.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
N. Dershowitz. Orderings for term rewriting systems. In 20th IEEE Symposium on Foundations of Computer Science, 1979. Extended version in [45].
Well-Foundedness of the Recursive Path Ordering in Coq - de Kleijn, Koprowski, van.. (2004) (Correct)
No context found.
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279-301, 1982.
Proving Semantical Equivalence of Data Specifications - Piessens, Steegmans (2005) (1 citation) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279--301, 1982.
Termination of Rewriting in the Calculus of Constructions - Walukiewicz-Chrzaszcz (2000) (3 citations) (Correct)
No context found.
Nachum Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279301, March 1982.
A General Framework to Build Contextual Cover Set Induction.. - STRATULAT (2001) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279-301, 1982.
Automating the Synthesis of Decision Procedures in a .. - Armando, Gallagher, .. (1996) (1 citation) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279--301, March 1982.
Deciding Confluence of Certain Term Rewriting Systems in.. - Tiwari (2002) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.
Deciding Confluence of Certain Term Rewriting Systems in.. - Tiwari (2002) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.
Linear and Unit-Resulting Refutations for Horn Theories - Baumgartner (1995) (5 citations) (Correct)
No context found.
N. Dershowitz. Orderings for Term-Rewriting Systems. Theoretical Computer Science, 17:279--301, 1982.
Mechanizing Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.
Improving Dependency Pairs - Giesl, Thiemann, Schneider-Kamp.. (2003) (Correct)
No context found.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.
Polynomials for Proving Termination of Context-Sensitive Rewriting - Lucas (2004) (Correct)
No context found.
N. Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279-301, 1982.
Complete Monotonic Semantic Path Orderings - Borralleras, Ferreira, Rubio (2000) (13 citations) (Correct)
No context found.
Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279--301, 1982.
First 50 documents Next 50
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