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

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

5 Citations (Scopus)
20 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of the 28th Annual Meeting of the Association for Computational Linguistics
Place of PublicationMorristown, NJ
PublisherAssociation for Computational Linguistics
Pages173-179
Number of pages7
DOIs
Publication statusPublished - 1990
Externally publishedYes
EventAnnual Meeting of the Association for Computational Linguistics (28th : 1990) - University of Pittsburgh, Pittsburgh, United States
Duration: 6 Jun 19909 Jun 1990

Conference

ConferenceAnnual Meeting of the Association for Computational Linguistics (28th : 1990)
Country/TerritoryUnited States
CityPittsburgh
Period6/06/909/06/90

Bibliographical note

Copyright the Publisher 1990. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Fingerprint

Dive into the research topics of 'Expressing disjunctive and negative feature constraints with classical first-order logic'. Together they form a unique fingerprint.

Cite this