A Complete and Recursive Feature Theory

Details A Complete and Recursive Feature Theory A Complete and Recursive Feature Theory

1994-06-10

arxiv.org/abs/cmp-lg/9406019v3

Computer Science

Computation and Language

Short version appeared in the 1992 Annual Meeting of the Association for Computational Linguistics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Complete and Recursive Feature Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Complete and Recursive Feature Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Complete and Recursive Feature Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41465