The logic of typed feature structures
The logic of typed feature structures
An optimized Prolog encoding of typed feature structures
Proceedings of the 1999 international conference on Logic programming
Metastructures versus Attributed Variables in the Context of Extensible Unification
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Design and implementation of the UIMA common analysis system
IBM Systems Journal
AVM description compilation using types as modes
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
A generalized-zero-preserving method for compact encoding of concept lattices
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
This paper presents a new formalization of a unification- or join-preserving encoding of partially ordered sets that more essentially captures what it means for an encoding to preserve joins, generalizing the standard definition in AI research. It then shows that every statically typable ontology in the logic of typed feature structures can be encoded in a data structure of fixed size without the need for resizing or additional union-find operations. This is important for any grammar implementation or development system based on typed feature structures, as it significantly reduces the overhead of memory management and reference-pointer-chasing during unification.