Classical logics for attribute-value languages

Authors:
Jürgen Wedekind
Affiliations:
C.S.L.I. - Stanford University
Venue:
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Year:
1991

Citing 5
Cited 1

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
An interpretation of negation in feature structure descriptions

Computational Linguistics
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Feature graphs and abstract data types: a unifying approach

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Some remarks on the decidability of the generation problem in LFG- and PATR-style unification grammars

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a classical logic for attribute-value (or feature description) languages which are used in unification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). The algorithm which is used for deciding satisfiability of a feature description is based on a restricted deductive closure construction for sets of literals (atomic formulas and negated atomic formulas). In contrast to the Kasper/Rounds approach (cf. [Kasper/Rounds 90]), we can handle cyclicity, without the need for the introduction of complexity norms, as in [Johnson 88] and [Beierle/Pletat 88]. The deductive closure construction is the direct proof-theoretic correlate of the congruence closure algorithm (cf. [Nelson/Oppen 80]), if it were used in attribute-value languages for testing satisfiability of finite sets of literals.