Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Cited In (only showing first 100 items - show all)

About the rewriting systems produced by the Knuth-Bendix completion algorithm
Term rewriting induction
Twenty years of rewriting logic
A new invariant of plane bipartite cubic graphs
The conservation theorem for differential nets
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Unification theory
Diagrammatic confluence for constraint handling rules
Adding algebraic rewriting to the untyped lambda calculus
Ordered rewriting and confluence
Confluence modulo equivalence in Constraint Handling Rules
Word problems and a homological finiteness condition for monoids
Some undecidable termination problems for semi-Thue systems
Undecidable properties of deterministic top-down tree transducers
Confluence without termination via parallel critical pairs
CSI -- a confluence tool
A catalogue of complete group presentations
Quasi-interpretations. A way to control resources
Orderings for term-rewriting systems
Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
Rewriting systems of Coxeter groups
The undecidability of the D_A-unification problem
Proofs by induction in equational theories with constructors
On recursive path ordering
The geometry of tensor calculus. I
Higher-order rewrite systems and their confluence
Decidable approximations of term rewriting systems
Higher categories, strings, cubes and simplex equations
Decreasing diagrams and relative termination
Decreasing diagrams and relative termination
A calculational approach to mathematical induction
On sufficient-completeness and related properties of term rewriting systems
Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Deterministic tree pushdown automata and monadic tree rewriting systems
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Unification in commutative theories
Towards a foundation of completion procedures as semidecision procedures
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
On word problems in Horn theories
Unification in a combination of arbitrary disjoint equational theories
A complete proof of correctness of the Knuth-Bendix completion algorithm
Decidability of elementary theories of certain finitely defined algebras
Confluence of one-rule Thue systems
Fundamental properties of infinite trees
Properties of substitutions and unifications
Proof by consistency
Termination of rewriting
A combinatory account of internal structure
The attributed pi-calculus with priorities
Attribute grammars and recursive program schemes. I. II
Game characterizations of logic program properties
Confluence by decreasing diagrams
Termination orderings for associative-commutative rewriting systems
Developing developments
Learning domain knowledge to improve theorem proving
Sequentiality in orthogonal term rewriting systems
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
Tree transducers with external functions
Confluent linear numeration systems
How to prove decidability of equational theories with second-order computation analyser SOL
Decision problems for semi-Thue systems with a few rules
Tableaux and hypersequents for justification logics
Confluence in probabilistic rewriting
Combination problems for commutative/monoidal theories or how algebra can help in equational unification
A finite Thue system with decidable word problem and without equivalent finite canonical system
Title not available (Why is that?)
Non-commutative Gröbner bases in algebras of solvable type
Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs
Decreasing subsequences in permutations and Wilf equivalence for involutions
Shallow confluence of conditional term rewriting systems
Term rewriting: Some experimental results
A confluent relational calculus for higher-order programming with constraints
Extended term rewriting systems
Series parallel digraphs with loops
A rationale for conditional equational programming
Importing logics
On the logic of unification
Embedding and Confluence of Graph Transformations with Negative Application Conditions
Strongly analytic tableaux for normal modal logics
Critical pair criteria for completion
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
On proving confluence modulo equivalence for Constraint Handling Rules
Conditional rewriting logic as a unified model of concurrency
EVANS' NORMAL FORM THEOREM REVISITED
Context-sensitive rewriting strategies
CoLL: a confluence tool for left-linear term rewrite systems
On lexicographic semi-commutations
Church-Rosser systems with respect to formal languages
Development closed critical pairs
Proving Confluence of Term Rewriting Systems Automatically
Approximate XML structure validation based on document-grammar tree similarity
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
Symmetric bimonoidal intermuting categories and \(\omega\times\omega\) reduced bar constructions
On deciding confluence of finite string-rewriting systems modulo partial commutativity
On equational theories, unification, and (un)decidability
Analysis of Dehn's algorithm by critical pairs
Anti-patterns for rule-based languages
Infinite complete group presentations
Explaining Gabriel-Zisman localization to the computer

This page was built for publication: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

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