Logic and feature structures

Authors:
Mark Johnson
Affiliations:
Cognitive and Linguistic Sciences, Brown University
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Year:
1991

Citing 7
Cited 0

Logical foundations of artificial intelligence

Logical foundations of artificial intelligence
A logic for partially specified data structures

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An interpretation of negation in feature structure descriptions

Computational Linguistics
Elements of the Theory of Computation

Elements of the Theory of Computation
Features and formulae

Computational Linguistics
Features and values

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Expressing disjunctive and negative feature constraints with classical first-order logic

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feature structures play an important role in linguistic knowledge representation in computational linguistics. Given the proliferation of different feature structure formalisms it is useful to have a "common language" to express them in. This paper shows how a variety of feature structures and constraints on them can be expressed in predicate logic (except for the use of circumscription for non-monotonic devices), including sorted feature values, subsumption constraints and the non-monotonic ANY values and "constraint equations". Many feature systems can be completely axiomatized in the Schonfinkel-Bernays class of first-order formulae, so the decidability of the satisfiability and validity problems for these systems follows immediately.