Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
An Algebraic Characterization of STUF
Computerlinguistik und ihre theoretischen Grundlagen, Symposium
Syntaktische und semantische Generalisierungen im strukturierten Lexikon
GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
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
Knowledge Representation for Natural Language Understanding: The L_LILOG Approach
IEEE Transactions on Knowledge and Data Engineering
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Classical logics for attribute-value languages
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Data types in computational phonology
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
Feature graphs appearing in unification-based grammar formalisms and algebraic specifications of abstract data types (ADTs) are both used for defining a collection of objects together with functions between these object sets. Starting from this observation we define an algebraic semantics for feature graphs by assigning an algebraic specification to each feature graph. This opens the rich world of semantical foundations for abstract data types to the area of feature graphs and thus to unification grammar formalisms. Using results from ADT theory we define a simple and fast syntactic decision procedure testing the usual consistency, constant/complex consistency and acyclicity on the algebraic specification assigned to a feature graph. With this machinery at hand feature graph unification becomes union of feature graph specifications followed by the consistency test.