Login: A logic programming language with built-in inheritance
Journal of Logic Programming
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Foundations of deductive databases and logic programming
The logic of typed feature structures
The logic of typed feature structures
Feature-constraint logics for unification grammars
Journal of Logic Programming
A feature constraint system for logic programming with entailment
FGCS'921 Selected papers of the conference on Fifth generation computer systems
On the decidability of functional uncertainty
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
Various feature descriptions are being employed in 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 features and sorts. We establish a complete first-order theory FT by means of three axiom schemes 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.