Pages that link to "Item:Q3067476"

The following pages link to Proving Termination Properties with mu-term (Q3067476):

Displaying 12 items.

• Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
• SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
• 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)
• 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)
• Use of Logical Models for Proving Operational Termination in General Logics (Q2827835) (← links)
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
• mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
• AC Completion with Termination Tools (Q5200044) (← links)
• Localized Operational Termination in General Logics (Q5256340) (← links)