Pages that link to "Item:Q1655487"
From MaRDI portal
The following pages link to Automatic synthesis of logical models for order-sorted first-order theories (Q1655487):
Displaying 11 items.
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- mu-term: Verify Termination Properties Automatically (System Description) (Q5049021) (← links)
- Local confluence of conditional and generalized term rewriting systems (Q6151615) (← links)
