Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
A flexible graph-unification formalism and its application to natural-language processing
IBM Journal of Research and Development
On subsumption and semiunification in feature algebras
Journal of Symbolic Computation
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Constituent coordination in Lexical-Functional Grammar
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Entailment of Non-structural Subtype Constraints
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to describe linguistic objects. We investigate the extension of basic feature logic with subsumption (or matching) constraints, based on a weak notion of subsumption. This mechanism of one-way information flow is generally deemed to be necessary to give linguistically satisfactory descriptions of coordination phenomena in such formalisms. We show that the problem whether a set of constraints is satisfiable in this logic is decidable in polynomial time and give a solution algorithm.