The following pages link to (Q3484383):
Displayed 20 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Matching - a special case of unification? (Q582272) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- Embedding Boolean expressions into logic programming (Q1100935) (← links)
- Computational approaches to analogical reasoning: A comparative analysis (Q1118423) (← links)
- A note on the completeness of resolution without self-resolution (Q1119561) (← links)
- Inheritance hierarchies: Semantics and unifications (Q1124313) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Hybrid reasoning using universal attachment (Q1329365) (← links)
- Unification in commutative semigroups (Q1383954) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Data storage interpretation of labeled modal logic (Q1919761) (← links)
- E-generalization using grammars (Q2457667) (← links)
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)