Please use this identifier to cite or link to this item:
doi:10.22028/D291-39776
Title: | Some Relationships between Unification, Restricted Unification, and Matching |
Author(s): | Bürckert, Hans-Jürgen |
Language: | English |
Year of Publication: | 1986 |
Place of publication: | Kaiserslautern |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We present restricted T-unification that is unification of terms under a given equational theory T with the restriction that not all variables are allowed to be substituted. Some relationships between restricted T-unification, unrestricted T-unification and T-matching (one-sided T-unification) are established. Our main result is that, in the case of an almost collapse free equational theory the most general restricted unifiers and for certain termpairs the most general matchers are also most general unrestricted unifiers, this does not hold for more general theories. Almost collapse free theories are theories, where only terms starting with projection symbols may collapse (Le to be T-equal) to variables. |
Link to this record: | urn:nbn:de:bsz:291--ds-397767 hdl:20.500.11880/36025 http://dx.doi.org/10.22028/D291-39776 |
Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
Series volume: | 86,5 |
Date of registration: | 22-Jun-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 | Size | Format | |
---|---|---|---|---|
SEKI-REPORT-SR-86-05_Bürckert_Some-Relationships-between-Unification-Restricted-Unification-and-Matching.pdf | 12,88 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.