Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

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

On graph rewritings
Modularity of simple termination of term rewriting systems with shared constructors
Strict coherence of conditional rewriting modulo axioms
On weakly confluent monadic string-rewriting systems
Confluence by critical pair analysis revisited
A superposition oriented theorem prover
Some undecidability results for non-monadic Church-Rosser Thue systems
Some results on the confluence property of combined term rewriting systems
Thue systems as rewriting systems
Implementing first-order rewriting with constructor systems
Linear numeration systems, \(\theta\)-developments and finite automata
Causal automata
On restrictions of ordered paramodulation with simplification
Completion for rewriting modulo a congruence
Complete sets of transformations for general E-unification
Title not available (Why is that?)
Properties of grammatical codes of trees
A Transformational Approach to Prove Outermost Termination Automatically
Conditional linearization
Any ground associative-commutative theory has a finite canonical system
A confluent calculus for concurrent constraint programming
A refinement of strong sequentiality for term rewriting with constructors
Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
Graph grammars and operational semantics
Congruential complements of ground term rewrite systems
Testing for the ground (co-)reducibility property in term-rewriting systems
Bottom-up tree pushdown automata and rewrite systems
Title not available (Why is that?)
Context rewriting
An improved general path order
Building exact computation sequences
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Bottom-up tree pushdown automata: Classification and connection with rewrite systems
Completeness of combinations of constructor systems
Decidable sentences of Church-Rosser congruences
De Bruijn's weak diamond property revisited
A note on a special one-rule semi-Thue system
Pushdown machines for the macro tree transducer
Unification in varieties of idempotent semigroups
Unification in combinations of collapse-free regular theories
On deciding the confluence of a finite string-rewriting system on a given congruence class
A Noetherian and confluent rewrite system for idempotent semigroups
Combining matching algorithms: The regular case
A formalization of the Knuth-Bendix(-Huet) critical pair theorem
Testing for the Church-Rosser property
Monadic Thue systems
Compositions with superlinear deterministic top-down tree transformations
When is a monoid a group? The Church-Rosser case is tractable
Finite complete rewriting systems and the complexity of word problem
Isoperimetric functions for graph products
Diagram techniques for confluence
Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
Automating the Knuth Bendix ordering
Graph expressions and graph rewritings
Unnecessary inferences in associative-commutative completion procedures
Using unavoidable set of trees to generalize Kruskal's theorem
Basic narrowing revisited
Infinite regular Thue systems
Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
Skew confluence and the lambda calculus with letrec
Termination Modulo Combinations of Equational Theories
Finite canonical rewriting systems for congruences generated by concurrency relations
The solutions of two star-height problems for regular trees
Cancellation rules and extended word problems
Rewrite systems for varieties of semigroups
A PVS theory for term rewriting systems
The problems of cyclic equality and conjugacy for finite complete rewriting systems
Consider only general superpositions in completion procedures
Resource operators for \(\lambda\)-calculus
New Undecidability Results for Properties of Term Rewrite Systems
Efficient ground completion
On relationship between term rewriting systems and regular tree languages
A strong restriction of the inductive completion procedure
Abduction in logic programming: A new definition and an abductive procedure based on rewriting
Rigid E-unification: NP-completeness and applications to equational matings
Confluence for graph transformations
Modular termination of \(r\)-consistent and left-linear term rewriting systems
Modularity in noncopying term rewriting
Redundancy criteria for constrained completion
Unique normal forms for nonlinear term rewriting systems: Root overlaps
Collapsed tree rewriting: Completeness, confluence, and modularity
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

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)