The following pages link to (Q3696500):
Displaying 14 items.
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- A term equality problem equivalent to graph isomorphism (Q1332775) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- An improved general path order (Q1925013) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- A Monotonic Higher-Order Semantic Path Ordering (Q2996192) (← links)
- Dependency Pairs and Polynomial Path Orders (Q3636818) (← links)
- (Q4447239) (← links)
- Predicate Completion for non-Horn Clause Sets (Q5200033) (← links)
- Recursive Path Orderings Can Also Be Incremental (Q5387842) (← links)
- A Higher-Order Iterative Path Ordering (Q5505590) (← links)
- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete (Q6488535) (← links)
- Improving associative path orderings (Q6488548) (← links)
- Positive deduction modulo regular theories (Q6560184) (← links)