scientific article
From MaRDI portal
Publication:3484383
zbMath0704.68096MaRDI QIDQ3484383
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A resolution principle for constrained logics ⋮ Hybrid reasoning using universal attachment ⋮ Embedding Boolean expressions into logic programming ⋮ Computational approaches to analogical reasoning: A comparative analysis ⋮ A note on the completeness of resolution without self-resolution ⋮ Data storage interpretation of labeled modal logic ⋮ Inheritance hierarchies: Semantics and unifications ⋮ Unification in commutative semigroups ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ E-generalization using grammars ⋮ Reduction rules for resolution-based systems ⋮ Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general ⋮ Average-case analysis of unification algorithms ⋮ AC-unification race: The system solving approach, implementation and benchmarks ⋮ Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria ⋮ Constructive negation and constraint logic programming with sets ⋮ Unification in a combination of arbitrary disjoint equational theories ⋮ Matching - a special case of unification? ⋮ Boolean unification - the story so far ⋮ On equational theories, unification, and (un)decidability
