Please use this identifier to cite or link to this item:
doi:10.22028/D291-24890
Title: | A complete and recursive feature theory |
Author(s): | Backofen, Rolf Smolka, Gert |
Language: | English |
Year of Publication: | 1992 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1992 |
SWD key words: | Künstliche Intelligenz Computerlinguistik Axiom |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | 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. |
Link to this record: | urn:nbn:de:bsz:291-scidok-36475 hdl:20.500.11880/24946 http://dx.doi.org/10.22028/D291-24890 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 92-30 |
Date of registration: | 25-Jun-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 | |
---|---|---|---|---|
RR_92_30.pdf | 257,02 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.