A Complete and Recursive Feature Theory
| dc.creator | Backofen, Rolf | |
| dc.creator | Smolka, Gert | |
| dc.date | 1994-06-10 | |
| dc.date | 1994-06-17 | |
| dc.date.accessioned | 2026-07-07T08:58:35Z | |
| dc.date.available | 2026-07-07T08:58:35Z | |
| dc.description | 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. | |
| dc.description | Short version appeared in the 1992 Annual Meeting of the Association for Computational Linguistics | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9406019 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9406019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147384 | |
| dc.subject | Computation and Language | |
| dc.title | A Complete and Recursive Feature Theory | |
| dc.type | text |