Higher-order and semantic unification

Nachum Dershowitz, Subrata Mitra

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science - 13th Conference, Proceedings
EditorsRudrapatna K. Shyamasundar
PublisherSpringer Verlag
Pages139-150
Number of pages12
ISBN (Print)9783540575290
DOIs
StatePublished - 1993
Externally publishedYes
Event13th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1993 - Bombay, India
Duration: 15 Dec 199317 Dec 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume761 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1993
Country/TerritoryIndia
CityBombay
Period15/12/9317/12/93

Fingerprint

Dive into the research topics of 'Higher-order and semantic unification'. Together they form a unique fingerprint.

Cite this