More problems in rewriting

DOI10.1007/978-3-662-21551-7_39MaRDI QIDQ5055812zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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

Cites work

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

Cited in

(11)

• Problems in rewriting III
• The first-order theory of one-step rewriting is undecidable
• 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
• scientific article; zbMATH DE number 5560346 (Why is no real title available?)
• On interreduction of semi-complete term rewriting systems

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)