Unification: a multidisciplinary survey

DOI10.1145/62029.62030MaRDI QIDQ3833654zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

algebraic manipulationanalysis of algorithms and problem complexityartificial intelligencecomputational complexitycomputations on discrete structuresequational theoriesgeneralizationgraphshigher order logicinfinite termsinheritancelatticeslogic programmingnatural language processingnonnumerical algorithms and problemsoccur checkparallel algorithmspattern matchingprologresolutiontheorem provingtype inferenceunification

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3871321
• scientific article; zbMATH DE number 4155934
• Grammatical unification
• scientific article; zbMATH DE number 4053011
• Model-theoretic aspects of unification

Cited in

(38)

• Unification theory
• Semantic networks
• Generalizations of unification
• A resolution principle for constrained logics
• The Kreisel length-of-proof problem
• Relaxed unification -- proposal
• Recognizing union-find trees is NP-complete
• Analogical program derivation based on type theory
• A unification-theoretic method for investigating the \(k\)-provability problem
• Source-tracking unification
• GUBS a Language for Synthetic Biology: Specification and Compilation
• On the parameterized complexity of associative and commutative unification
• Generating languages by a derivation procedure for elementary formal systems
• scientific article; zbMATH DE number 4016225 (Why is no real title available?)
• scientific article; zbMATH DE number 4191091 (Why is no real title available?)
• What is essential unification?
• scientific article; zbMATH DE number 3871321 (Why is no real title available?)
• scientific article; zbMATH DE number 4155934 (Why is no real title available?)
• scientific article; zbMATH DE number 4049129 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 40567 (Why is no real title available?)
• Polytypic unification
• scientific article; zbMATH DE number 475429 (Why is no real title available?)
• scientific article; zbMATH DE number 6917940 (Why is no real title available?)
• Graph unification and matching
• E-unification based on generalized embedding
• Introduction to the special issue: Unification
• Recognizing union-find trees is NP-complete, even without rank info
• scientific article; zbMATH DE number 274906 (Why is no real title available?)
• A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading
• A graph unification machine for NL parsing
• A (machine-oriented) logic based on pattern matching
• Unification theory
• Model-theoretic aspects of unification
• Unranked Nominal Unification
• Comparing generic state machines
• On the parameterized complexity of associative and commutative unification
• Verification conditions are code

This page was built for publication: Unification: a multidisciplinary survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833654)