Bi-rewriting, a term rewriting technique for monotonic order relations

DOI10.1007/978-3-662-21551-7_3zbMath1503.68131OpenAlexW1593787352MaRDI QIDQ5055782

Jordi Levy, Jaume Agustí

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_3

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Structure theory of lattices (06B05)

Related Items (5)

Deciding confluence of certain term rewriting systems in polynomial time ⋮ Bi-rewriting, a term rewriting technique for monotonic order relations ⋮ Linear second-order unification ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Ordered chaining for total orderings

Cites Work

• A semantics of multiple inheritance
• Inheritance hierarchies: Semantics and unifications
• Algebraic semantics
• Reasoning and revision in hybrid representation systems
• Conditional rewriting logic as a unified model of concurrency
• Completion for rewriting modulo a congruence
• Completion of a Set of Rules Modulo a Set of Equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complete Sets of Reductions for Some Equational Theories
• Bi-rewriting, a term rewriting technique for monotonic order relations
• On the Church-Rosser property for the direct sum of term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bi-rewriting, a term rewriting technique for monotonic order relations