Please use this identifier to cite or link to this item: doi:10.22028/D291-36881
Title: Unification of idempotent functions
Author(s): Raulefs, Peter
Siekmann, Jörg
Language: English
Year of Publication: 1978
Place of publication: Karlsruhe
Free key words: automatic theorem proving
matching algorithms
T-unification
idempotence
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: A complete algorithm for terms involving idempotent an idempotent-commutative functions is presented. The main results are: The unification problem for both cases is decidable and the set of unifiers is finite for both problems.
Link to this record: urn:nbn:de:bsz:291--ds-368810
hdl:20.500.11880/33531
http://dx.doi.org/10.22028/D291-36881
Series name: Memo SEKI : SEKI-Projekt / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI
Series volume: 78,1
Date of registration: 27-Jul-2022
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 
MEMO SEKI-78-I Unification of idempotent Functions_p.pdf18,3 MBAdobe PDFView/Open


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