The following pages link to (Q5678447):
Displaying 50 items.
- Unification in commutative theories (Q582071) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Order-sorted unification (Q582269) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Symbolic constraint handling through unification in finite algebras (Q757060) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On word problems in Horn theories (Q757095) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Subset-equational programming in intelligent decision systems (Q805225) (← links)
- Unification in commutative rings is not finitary (Q916417) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Flat matching (Q999086) (← links)
- Equational methods in first order predicate calculus (Q1065783) (← links)
- Properties of substitutions and unifications (Q1074342) (← links)
- On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
- On unification: Equational theories are not bounded (Q1094131) (← links)
- A note on unification type zero (Q1098285) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- Embedding Boolean expressions into logic programming (Q1100935) (← links)
- A class of confluent term rewriting systems and unification (Q1101209) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Unification in commutative idempotent monoids (Q1111775) (← links)
- Finite generation of ambiguity in context-free languages (Q1117043) (← links)
- Enumerating outer narrowing derivations for constructor-based term rewriting systems (Q1124376) (← links)
- Makanin's algorithm is not primitive recursive (Q1127320) (← links)
- Completion for unification (Q1178701) (← links)
- The unification hierarchy is undecidable (Q1181721) (← links)
- Learning elementary formal systems (Q1186429) (← links)
- Multimodal logic programming using equational and order-sorted logic (Q1199813) (← links)
- An improved general \(E\)-unification method (Q1201347) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Non-resolution theorem proving (Q1238434) (← links)
- Towards the automation of set theory and its logic (Q1253108) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Complete sets of transformations for general E-unification (Q1262754) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Word unification and transformation of generalized equations (Q1319389) (← links)
- Competing for the \(AC\)-unification race (Q1319390) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- On Skolemization in constrained logics (Q1380406) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Superposition with completely built-in abelian groups (Q1432887) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
