Pages that link to "Item:Q3732980"
From MaRDI portal
The following pages link to Semantic confluence tests and completion methods (Q3732980):
Displayed 20 items.
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems (Q1325836) (← links)
- Abstract data type systems (Q1391729) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Reasoning with conditional axioms (Q1924731) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)