Pages that link to "Item:Q347382"

The following pages link to Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382):

Displaying 9 items.

• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
• Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
• Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
• Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
• Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
• The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
• Using well-founded relations for proving operational termination (Q2303238) (← links)
• Automatic generation of logical models with AGES (Q2305421) (← links)
• mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)