TY - GEN
T1 - Higher-order and semantic unification
AU - Dershowitz, Nachum
AU - Mitra, Subrata
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unification procedure for R. Furthermore, we use the system of transformation rules to provide a syntactic characterization for R which results in decidability of semantic unification.
AB - We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unification procedure for R. Furthermore, we use the system of transformation rules to provide a syntactic characterization for R which results in decidability of semantic unification.
UR - http://www.scopus.com/inward/record.url?scp=85028474122&partnerID=8YFLogxK
U2 - 10.1007/3-540-57529-4_49
DO - 10.1007/3-540-57529-4_49
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85028474122
SN - 9783540575290
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 139
EP - 150
BT - Foundations of Software Technology and Theoretical Computer Science - 13th Conference, Proceedings
A2 - Shyamasundar, Rudrapatna K.
PB - Springer Verlag
Y2 - 15 December 1993 through 17 December 1993
ER -