Pages that link to "Item:Q1106659"

The following pages link to Critical pair criteria for completion (Q1106659):

Displaying 22 items.

• Multi-completion with termination tools (Q352956) (← links)
• Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
• Redundancy criteria for constrained completion (Q673620) (← links)
• Automated proofs of the Moufang identities in alternative rings (Q912653) (← links)
• Completion for rewriting modulo a congruence (Q1262752) (← links)
• On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
• Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
• Twee: an equational theorem prover (Q2055894) (← links)
• Ground joinability and connectedness in the superposition calculus (Q2104507) (← links)
• Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
• Relative termination via dependency pairs (Q2360875) (← links)
• Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
• Computing ground reducibility and inductively complete positions (Q5055712) (← links)
• Consider only general superpositions in completion procedures (Q5055743) (← links)
• Simulating Buchberger's algorithm by Knuth-Bendix completion (Q5055776) (← links)
• Redundancy criteria for constrained completion (Q5055781) (← links)
• AC-complete unification and its application to theorem proving (Q5055849) (← links)
• Confluence of terminating conditional rewrite systems revisited (Q5055864) (← links)
• The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
• The 9th IJCAR Automated Theorem Proving System Competition – CASC-J9 (Q5145447) (← links)
• On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
• Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)