The following pages link to Conditional rewrite rules (Q1065790):
Displaying 43 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems (Q671506) (← links)
- Proving semantical equivalence of data specifications (Q678825) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Conditional linearization (Q698633) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- On word problems in Horn theories (Q757095) (← 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)
- Rewriting with equivalence relations in ACL2 (Q928668) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← 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)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Rewriting systems over similarity and generalized pseudometric spaces and their properties (Q1677217) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE (Q3188328) (← links)
- Priority rewriting: Semantics, confluence, and conditionals (Q5055727) (← links)
- Conditional rewrite rule systems with built-in arithmetic and induction (Q5055742) (← links)
- Confluence of terminating conditional rewrite systems revisited (Q5055864) (← links)
- Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
- A constructor-based approach for positive/negative-conditional equational specifications (Q5881186) (← links)
- Extended term rewriting systems (Q5881265) (← links)
- Proof by consistency in conditional equational theories (Q5881278) (← links)
- Confluence of the disjoint union of conditional term rewriting systems (Q5881285) (← links)
- Constrained equational deduction (Q5881303) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
- Proving confluence in the confluence framework with confident (Q6622001) (← links)
