Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
A complete and recursive feature theory
URN: urn:nbn:de:bsz:291-scidok-36475
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3647/
Quelle:
(1992) Kaiserslautern ; Saarbrücken : DFKI, 1992
pdf-Format:
Dokument 1.pdf (257 KB)
SWD-Schlagwörter:
Künstliche Intelligenz , Computerlinguistik , Axiom
Institut:
DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer:
92-30
Sprache:
Englisch
Erstellungsjahr:
1992
Publikationsdatum:
25.06.2011
Kurzfassung auf Englisch:
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions considered in this paper are the possibly quantified first-order formulae obtained from a signature of binary and unary predicates called features and sorts, respectively. We establish a first-order theory FT by means of three axiom schemes, show its completeness, and construct three elementarily equivalent models. One of the models consists of so-called feature graphs, a data structure common in computational linguistics. The other two models consist of so-called feature trees, a record-like data structure generalizing the trees corresponding to first-order terms. Our completeness proof exhibits a terminating simplification system deciding validity and satisfiability of possibly quantified feature descriptions.
Lizenz:
Standard-Veröffentlichungsvertrag