The following pages link to Conditional rewrite rules (Q1065790):
Displayed 19 items.
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Proving semantical equivalence of data specifications (Q678825) (← links)
- A completion procedure for conditional equations (Q758211) (← links)
- On completeness of narrowing strategies (Q912605) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Rewrite method for theorem proving in first order theory with equality (Q1098649) (← links)
- Simplifying conditional term rewriting systems: Unification, termination and confluence (Q1100891) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- Contextual rewriting as a sound and complete proof method for conditional LOG-specifications (Q1323311) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)