The following pages link to Ordered rewriting and confluence (Q6488545):
Displaying 25 items.
- Composing ordered sequential consistency (Q522973) (← links)
- Bi-rewrite systems (Q674746) (← links)
- Efficient deduction in equality Horn logic by Horn-completion (Q1182107) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Twee: an equational theorem prover (Q2055894) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Ground joinability and connectedness in the superposition calculus (Q2104507) (← links)
- AC simplifications and closure redundancies in the superposition calculus (Q2142076) (← links)
- Certified equational reasoning via ordered completion (Q2305436) (← links)
- Confluence in probabilistic rewriting (Q2333318) (← links)
- Reduction operators and completion of rewriting systems (Q2399863) (← links)
- Structures for abstract rewriting (Q2642463) (← links)
- On a term rewriting system controlled by sequences of integers (Q2702044) (← links)
- Order-Sorted Rewriting and Congruence Closure (Q2811360) (← links)
- Semantic confluence tests and completion methods (Q3732980) (← links)
- Implementing Superposition in iProver (System Description) (Q5049017) (← links)
- The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
- The 9th IJCAR Automated Theorem Proving System Competition – CASC-J9 (Q5145447) (← links)
- Associative-commutative deduction with constraints (Q5210795) (← links)
- Soft typing for ordered resolution (Q5234715) (← links)
- Quick specifications for the busy programmer (Q5371995) (← links)
- Compatibility of order-sorted rewrite rules (Q5881301) (← links)
