Abstract
This paper identifies a misconception about the algebraic structure underlying the view of transitive closure as a matrix multiplication problem. This is the mathematical basis of the technique that has been used for the efficient compilation of partially ordered sets of objects or types in programming languages for the past ten years. It also shows that the correct structure, a closed semi-ring, can also be extended to objects or type signatures that are augmented with attributes, constraints on the multiple inheritance of those attributes, and/or constraints on what types of values the attributes can take. As a specific example in the realm of linguistic knowledge representation, it is shown that every operation necessary for computing the closure of attributed type signature specifications in the logic of typed feature structures (Carpenter, 1992), the logical underpinning of the linguistic theory, Head-driven Phrase Structure Grammar (Pollard and Sag, 1987, 1994), can be reduced to matrix arithmetic using this construction. Other practical consequences of using the correct structure, such as the algorithmic complexity of multiplication and closure operations, are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A., J. Hopcroft and J. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974
Aït-Kaći, H., R. Boyer, P. Lincoln and R. Nasr. Efficient Implementation of Lattice Operations. ACM Transactions on Programming Languages and Systems11(1): 115–146, 1989.
Allison, L. A Practical Introduction to Denotational Semantics, Cambridge University Press, Cambridge, 1986.
Carpenter, B. The Logic of Typed Feature Structures, Cambridge University Press, Cambridge, 1992.
Carpenter, B. and G. Penn. Compiling Typed Attribute-Value Logic Grammars. In H. Bunt and M. Tomita, editors, Recent Advances in Parsing Technologies. Kluwer, Dordrecht, 1996.
Coppersmith, D. and S. Winograd. Matrix Multiplication via Arithmetic Progression. Journal of Symbolic Computation9(3): 251–280, 1990. Special Issue on Computational Algebraic Complexity.
Cormen, T.H., C.E. Leiserson and R.L. Rivest. Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
Davey, B.A. and H.A. Priestley. Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
Fall, A. Reasoning with Taxonomies. Ph.D. thesis, Simon Fraser University, 1996.
Ganguly, D., C. Mohan and S. Ranka. A Space-and-Time-Efficient Coding Algorithm for Lattice Computations. IEEE Transactions on Knowledge and Data Engineering6(5): 819–829, 1994.
Mellish, C. Implementing Systemic Classification by Unification. Computational Linguistics14(1), 40–51, 1988.
Mellish, C. Term-Encodable Description Spaces. In D. Brough, editor, Logic Programming: New Frontiers, 189–207. Kluwer, Dordrecht, 1992.
Penn, G. The Algebraic Structure of Attributed Type Signatures. Ph.D. thesis, Carnegie Mellon University, 2000.
Pollard, C. and I. Sag. Information-Based Syntax and Semantics, No. 13 in CSLI Lecture Notes. CSLI, Stanford, CA, 1987.
Pollard, C. and I. Sag. Head-Driven Phrase Structure Grammar, University of Chigaco Press, Chicago, 1994.
Prosser, R.T. Applications of Boolean Matrices to the Analysis of Flow Diagrams. In Proceedings of the 16th Eastern Joint Computer Conference, 133–138, 1959.
Smolka, G. A Feature Logic with Subsorts. Technical Report LILOG 33, IBM Germany, Stuttgart, 1988.
Strassen, V. Gaussian Elimination is not Optimal. Numerische Mathematik, 14(3): 354–356, 1969.
Warshall, S. A Theorem on Boolean Matrices. Journal of the ACM, 9(1): 11–12, 1962.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Penn, G. The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures. Grammars 3, 295–312 (2000). https://doi.org/10.1023/A:1009969528224
Issue Date:
DOI: https://doi.org/10.1023/A:1009969528224