Pages that link to "Item:Q5055779"
From MaRDI portal
The following pages link to Any ground associative-commutative theory has a finite canonical system (Q5055779):
Displaying 13 items.
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Decidability and complexity analysis by basic paramodulation (Q1281494) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q1357668) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
- Proving equational and inductive theorems by completion and embedding techniques (Q5055774) (← links)
- On ground AC-completion (Q5055778) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
- Theorem proving modulo associativity (Q6560183) (← links)