Pages that link to "Item:Q1281494"
From MaRDI portal
The following pages link to Decidability and complexity analysis by basic paramodulation (Q1281494):
Displaying 6 items.
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- Calculi in which derivability is decidable by finite interpretations (Q1121677) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Unification and Matching in Hierarchical Combinations of Syntactic Theories (Q2964469) (← links)
- Automated Deduction – CADE-19 (Q5900731) (← links)