SciDok

Eingang zum Volltext in SciDok

Lizenz

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-38948
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3894/


PAntUDE - an anti-unification algorithm for expressing refined generalizations

Fischer, Cornelia

Quelle: (1994) Kaiserslautern ; Saarbrücken : DFKI, 1994
pdf-Format:
Dokument 1.pdf (235 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Künstliche Intelligenz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Technical memo / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-0071]
Bandnummer: 94-04
Sprache: Englisch
Erstellungsjahr: 1994
Publikationsdatum: 08.07.2011
Kurzfassung auf Englisch: 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).
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English