Pages that link to "Item:Q3938536"

The following pages link to Complete Sets of Reductions for Some Equational Theories (Q3938536):

Displaying 50 items.

• Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
• Extending reduction orderings to ACU-compatible reduction orderings (Q293311) (← links)
• Unification in commutative theories (Q582071) (← links)
• Orderings for term-rewriting systems (Q593789) (← links)
• Confluence for graph transformations (Q672753) (← links)
• Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
• Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
• Hilbert's tenth problem is of unification type zero (Q688556) (← links)
• Complexity of unification problems with associative-commutative operators (Q688565) (← links)
• Refutational theorem proving using term-rewriting systems (Q802317) (← links)
• Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
• Equational completion in order-sorted algebras (Q912606) (← links)
• Automated proofs of the Moufang identities in alternative rings (Q912653) (← links)
• A rewriting strategy to verify observational congruence (Q915472) (← links)
• Inductive proof search modulo (Q1037404) (← links)
• Axiomatisation des tests (Q1062748) (← links)
• Equational methods in first order predicate calculus (Q1065783) (← links)
• Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
• Reductions in tree replacement systems (Q1082092) (← links)
• On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
• Unification in varieties of idempotent semigroups (Q1092171) (← links)
• Rewriting with a nondeterministic choice operator (Q1096383) (← links)
• Complexity of matching problems (Q1099615) (← links)
• Associative-commutative unification (Q1099648) (← links)
• Unification in combinations of collapse-free regular theories (Q1099652) (← links)
• A class of confluent term rewriting systems and unification (Q1101209) (← links)
• History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
• Critical pair criteria for completion (Q1106659) (← links)
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
• Efficient solution of linear diophantine equations (Q1121310) (← links)
• A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801) (← links)
• Combining matching algorithms: The regular case (Q1186723) (← links)
• Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
• Conditional narrowing modulo a set of equations (Q1261194) (← links)
• Completion for rewriting modulo a congruence (Q1262752) (← links)
• Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
• A categorical critical-pair completion algorithm (Q1300576) (← links)
• Automated proofs of equality problems in Overbeek's competition (Q1319385) (← links)
• Automated deduction with associative-commutative operators (Q1340508) (← links)
• Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
• On using ground joinable equations in equational theorem proving (Q1404987) (← links)
• Theorem proving modulo (Q1431339) (← links)
• Superposition with completely built-in abelian groups (Q1432887) (← links)
• Partial completion of equational theories (Q1592635) (← links)
• ELAN from a rewriting logic point of view (Q1608914) (← links)
• Equational rules for rewriting logic (Q1608925) (← links)
• Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
• Invariants and closures in the theory of rewrite systems (Q1815344) (← links)