Please use this identifier to cite or link to this item:
doi:10.22028/D291-25053
Title: | PAntUDE - an anti-unification algorithm for expressing refined generalizations |
Author(s): | Fischer, Cornelia |
Language: | English |
Year of Publication: | 1994 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1994 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | In this paper some improvements for the basic algorithm for anti-unification are presented. The standard (basic) algorithm for anti-unification still may give too general answers with respect to the intended use of the result. "Too general" means obtaining an unwanted answer when instantiating some variables of the anti-unification output term. To avoid this, a term sometimes should be generalized by regarding certain (semantic) restrictions. In PAntUDE (partial anti-unification with domains and exclusions) two principal improvements of the basic algorithm were implemented and tested: it can use masks for preventing anti-unification of certain arguments (partial anti-unification); it can also use finite domains for enumerating input-term constants instead of introducing a new (universally quantified) variable, and finite exclusions for specifying forbidden constants (anti-unification with domains and exclusions). |
Link to this record: | urn:nbn:de:bsz:291-scidok-38948 hdl:20.500.11880/25109 http://dx.doi.org/10.22028/D291-25053 |
Series name: | Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071] |
Series volume: | 94-04 |
Date of registration: | 8-Jul-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
TM_94_04.pdf | 234,6 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.