Expressing disjunctive and negative feature constraints with classical first-order logic

Authors:
Mark Johnson
Affiliations:
Brown University, Providence, RI
Venue:
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Year:
1990

Citing 8
Cited 4

A logic for partially specified data structures

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Category structures

Computational Linguistics
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
The semantics of grammar formalisms seen as computer languages

ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A three-valued interpretation of negation in feature structure descriptions

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Categorial unification grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics

Features and formulae

Computational Linguistics
Computing with features as formulae

Computational Linguistics
Processing language with logical types and active constraints

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Logic and feature structures

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatized in classical first-order logic, which can express disjunctive and negative constraints. Because only quantifier-free formulae are used in the axiomatization, the satisfiability problem is NP-complete.