Unification: a multidisciplinary survey

DOI10.1145/62029.62030zbMath0677.68098WikidataQ55921415 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 complexity; theorem proving; artificial intelligence; inheritance; graphs; parallel algorithms; unification; lattices; natural language processing; generalization; resolution; pattern matching; logic programming; type inference; equational theories; higher order logic; occur check; computations on discrete structures; prolog; algebraic manipulation; infinite terms; analysis of algorithms and problem complexity; nonnumerical algorithms and problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T99: Artificial intelligence

68P05: Data structures

68T50: Natural language processing

Related Items

A graph unification machine for NL parsing, Verification conditions are code, Semantic networks, A resolution principle for constrained logics, The Kreisel length-of-proof problem, Relaxed unification -- proposal, Analogical program derivation based on type theory, A unification-theoretic method for investigating the \(k\)-provability problem, Source-tracking unification, Unnamed Item