More problems in rewriting

DOI10.1007/978-3-662-21551-7_39OpenAlexW2126600408MaRDI QIDQ5055812FDOQ5055812

Authors: Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_39

Recommendations

• Problems in rewriting III
• Term Rewriting and Applications
• Rewriting
• Twenty years of rewriting logic
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The chemical abstract machine
• A calculus of mobile processes. I
• Complete Sets of Reductions for Some Equational Theories
• Title not available (Why is that?)
• Simulation of Turing machines by a left-linear rewrite rule
• Confluence of one-rule Thue systems
• Termination and completion modulo associativity, commutativity and identity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete sets of reductions modulo associativity, commutativity and identity
• Unification in a combination of arbitrary disjoint equational theories
• Complexity of unification problems with associative-commutative operators
• Conditional rewriting logic as a unified model of concurrency
• Modular properties of conditional term rewriting systems
• A rationale for conditional equational programming
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Implementing term rewriting by jungle evaluation
• Title not available (Why is that?)
• On sufficient-completeness and related properties of term rewriting systems
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Title not available (Why is that?)
• Unification problems with one-sided distributivity
• Confluence by decreasing diagrams
• Title not available (Why is that?)
• Graph minors. IV: Tree-width and well-quasi-ordering
• Unification in a combination of equational theories: an efficient algorithm
• Termination of rewrite systems by elementary interpretations
• Trees, ordinals and termination
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Completion of a Set of Rules Modulo a Set of Equations
• On the Church-Rosser property for the direct sum of term rewriting systems
• Title not available (Why is that?)
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Automatic proofs by induction in theories without constructors
• Transfinite reductions in orthogonal term rewriting systems
• Encompassment properties and automata with constraints
• Explicit representation of terms defined by counter examples
• Rewrite systems for varieties of semigroups
• Modularity of simple termination of term rewriting systems with shared constructors
• A new method for undecidability proofs of first order theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transfinite reductions in orthogonal term rewriting systems
• Completeness of combinations of constructor systems
• A precedence-based total AC-compatible ordering
• Extension of the associative path ordering to a chain of associative commutative symbols
• Implementing term rewriting by graph reduction: Termination of combined systems
• On relationship between term rewriting systems and regular tree languages
• Typed lambda calculi and applications. International conference, TLCA '93, March 16--18, 1993, Utrecht, the Netherlands. Proceedings
• Simple LPO constraint solving methods
• Title not available (Why is that?)
• Reduction graphs in the lambda calculus
• Title not available (Why is that?)
• Completion of rewrite systems with membership constraints
• Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
• The Church-Rosser property for ground term-rewriting systems is decidable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Confluence of the lambda calculus with left-linear algebraic rewriting
• Title not available (Why is that?)
• Calcul de longueurs de chaînes de réécriture dans le monoïde libre
• Title not available (Why is that?)
• Open problems in rewriting
• Computing linearizations using test sets
• Termination for the direct sum of left-linear term rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• The term rewriting approach to automated theorem proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Satisfiability of the smallest binary program
• Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
• About the theory of tree embedding
• Title not available (Why is that?)
• The negation elimination from syntactic equational formula is decidable
• Decidability of regularity and related properties of ground normal form languages
• Title not available (Why is that?)
• Combination techniques and decision problems for disunification
• An efficient representation of arithmetic for term rewriting
• Title not available (Why is that?)
• A partial solution for \(D\)-unification based on a reduction to AC1-unification
• Type removal in term rewriting
• AC complement problems: Satisfiability and negation elimination
• Linear completion

Cited In (11)

• The undecidability of the first-order theories of one step rewriting in linear canonical systems
• Rewrite systems for integer arithmetic
• The first-order theory of lexicographic path orderings is undecidable
• The first-order theory of linear one-step rewriting is undecidable
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Non-existent Statman's double fixed point combinator does not exist, indeed
• Thue trees
• Title not available (Why is that?)
• On interreduction of semi-complete term rewriting systems
• Problems in rewriting III
• The first-order theory of one-step rewriting is undecidable

This page was built for publication: More problems in rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055812)