Unification: a multidisciplinary survey

DOI10.1145/62029.62030zbMath0677.68098OpenAlexW2157266926WikidataQ55921415 ScholiaQ55921415MaRDI QIDQ3833654

Kevin M. Knight

Publication date: 1989

Published in: ACM Computing Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62029.62030

zbMATH Keywords

computational complexitytheorem provingartificial intelligenceinheritancegraphsparallel algorithmsunificationlatticesnatural language processinggeneralizationresolutionpattern matchinglogic programmingtype inferenceequational theorieshigher order logicoccur checkcomputations on discrete structuresprologalgebraic manipulationinfinite termsanalysis of algorithms and problem complexitynonnumerical algorithms and problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Data structures (68P05) Natural language processing (68T50)

Related Items

A resolution principle for constrained logics, Generating languages by a derivation procedure for elementary formal systems, The Kreisel length-of-proof problem, Verification conditions are code, A graph unification machine for NL parsing, E-Unification based on Generalized Embedding, GUBS a Language for Synthetic Biology: Specification and Compilation, On the Parameterized Complexity of Associative and Commutative Unification, Recognizing union-find trees is NP-complete, A (machine-oriented) logic based on pattern matching, Model-theoretic aspects of unification, A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading, Relaxed unification -- proposal, What Is Essential Unification?, Graph unification and matching, Unification theory, Semantic networks, Unnamed Item, On the parameterized complexity of associative and commutative unification, Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, Unnamed Item, Analogical program derivation based on type theory, A unification-theoretic method for investigating the \(k\)-provability problem, Source-tracking unification