Login: A logic programming language with built-in inheritance
Journal of Logic Programming
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
A logic for partially specified data structures
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
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
Inclusion, disjointness and choice: the logic of linguistic classification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification with lazy non-redundant copying
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A transfer model using a typed feature structure rewriting system with inheritance
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A three-valued interpretation of negation in feature structure descriptions
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Generation for dialogue translation using typed feature structure unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make linguistic descriptions compact and thus easy to understand. Negative descriptions can be classified into three primitive negative descriptions: (1) negations of type symbols, (2) negations of feature existences, and (3) negations of feature-address value agreements. The formalization proposed in this paper is based on Aït-Kaci's complex terms. The first description is treated by extending type symbol lattices to include complement type symbols. The second and third are treated by augmenting term structures with structures representing these negations. Algorithms for augmented-TFS unification have been developed using graph unification, and programs using these algorithms have been written in Common Lisp.