TY - RPRT
T1 - PAntUDE - an anti-unification algorithm for expressing refined generalizations
T3 - Kaiserslautern ; Saarbrücken : DFKI, 1994
A1 - Fischer,Cornelia
Y1 - 2011/07/08
N2 - 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).
KW - Künstliche Intelligenz
CY - Saarbrücken
PB - Saarländische Universitäts- und Landesbibliothek
AD - Postfach 151141, 66041 Saarbrücken
UR - http://scidok.sulb.uni-saarland.de/volltexte/2011/3894
ER -