An attributive logic of set descriptions and set operations

Authors:
Suresh Manandhar
Affiliations:
The University of Edinburgh, Edinburgh, UK
Venue:
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Year:
1994

Citing 10
Cited 4

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

Information-based syntax and semantics: Vol. 1: fundamentals
Subsumption in KL-ONE is undecidable

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Attributive concept descriptions with complements

Artificial Intelligence
The logic of typed feature structures

The logic of typed feature structures
Feature-constraint logics for unification grammars

Journal of Logic Programming
Inheritance and constraint-based grammar formalisms

Computational Linguistics - Special issue on inheritance: I
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Features and formulae

Computational Linguistics
Experiments in reusability of grammatical resources

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics

Deterministic consistency checking of LP constraints

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
ProFIT: prolog with features, inheritance and templates

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Chart parsing and constraint programming

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Set unification

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted universal role quantifications, set union, intersection, subset and disjointness. A sound, complete and terminating consistency checking procedure is provided to determine the consistency of any given term in the logic. It is shown that determining consistency of terms is a NP-complete problem.