Please use this identifier to cite or link to this item: doi:10.22028/D291-40238
Title: The Unification Hierarchy is Undecidable
Author(s): Nutt, Werner
Language: English
Year of Publication: 1989
Place of publication: Kaiserslautern
Free key words: Equational Theories
Matching
Unification
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: In unification theory, equational theories can be classified according to the existence and cardinality of minimal complete solution sets for equation systems. For unitary, finitary, and infinitary theories minimal complete solution sets always exist and are singletons, finite, or possibly infinite sets, respectively. In nullary theories, minimal complete sets do not exist for some equation systems. These classes form the unification hierarchy. We show that it is not possible to decide where a given equational theory resides in the unification hierarchy. Moreover, it is proved that for some classes this problem is not even recursively enumerable.
Link to this record: urn:nbn:de:bsz:291--ds-402384
hdl:20.500.11880/36250
http://dx.doi.org/10.22028/D291-40238
Series name: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Series volume: 89,6
Date of registration: 14-Aug-2023
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professorship: SE - Sonstige
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
SEKI-Report-SR-89-06_Nutt_The-Unification-Hierarchy-is-Undecidable.pdf4,47 MBAdobe PDFView/Open


Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.