The following pages link to Unification theory (Q1124375):
Displaying 50 items.
- Order-sorted unification (Q582269) (← links)
- Unification, finite duality and projectivity in varieties of Heyting algebras (Q598304) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Pattern-directed invocation with changing equations (Q809619) (← links)
- Unification in commutative rings is not finitary (Q916417) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- The unification hierarchy is undecidable (Q1181721) (← links)
- Combining matching algorithms: The regular case (Q1186723) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- An order-sorted logic for knowledge representation systems (Q1193487) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Category equivalence preserves unification type (Q1272240) (← links)
- A decision algorithm for distributive unification (Q1275018) (← links)
- Word unification and transformation of generalized equations (Q1319389) (← links)
- Unification in free distributive lattices (Q1322163) (← links)
- Semi-unification of two terms in Abelian groups (Q1336738) (← links)
- Unification in partially commutative semigroups (Q1337561) (← links)
- The Kreisel length-of-proof problem (Q1353977) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- Reduction of cycle unification of type \(Cpg+r\) (Q1383467) (← links)
- Unification in commutative semigroups (Q1383954) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- A formal semantics for DAI language NUML (Q1894325) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Best solving modal equations (Q1971794) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- Anti-unification and the theory of semirings (Q2215964) (← links)
- A formalisation of nominal C-matching through unification with protected variables (Q2333665) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
- Essential unifiers (Q2494722) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- A Modular Equational Generalization Algorithm (Q3617428) (← links)
- (Q3994022) (← links)
- Retrieving library functions by unifying types modulo linear isomorphism (Q4304554) (← links)
- Unification and Passive Inference Rules for Modal Logics (Q4443406) (← links)
- Analogical projection in pattern perception (Q4467050) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)
- Using types as search keys in function libraries (Q4939694) (← links)
- Order-Sorted Generalization (Q4982625) (← links)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV (Q5009678) (← links)
- Formalising nominal C-unification generalised with protected variables (Q5022930) (← links)
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification (Q5055754) (← links)
- Undecidable properties of syntactic theories (Q5055755) (← links)
