The algebraic structure of transitive closure and its application to attributed type signatures

Grammars

Volumn 3, Issue 2-3, 2000, Pages 295-312

  Penn, Gerald ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Attribute value logic; Lattice representation; Matrix multiplication; Taxonomical classification

Indexed keywords

EID: 26944475637     PISSN: 13861793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Aho, A., J. Hopcroft and J. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974,
2. Aït-Kaći, H., R. Boyer, P. Lincoln and R. Nasr. Efficient Implementation of Lattice Operations. ACM Transactions on Programming Languages and Systems 11(1): 115-146, 1989.
3. Allison, L. A Practical Introduction to Denotational Semantics, Cambridge University Press, Cambridge, 1986.
4. Carpenter, B. The Logic of Typed Feature Structures, Cambridge University Press, Cambridge, 1992.
5. 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.
6. Coppersmith, D. and S. Winograd. Matrix Multiplication via Arithmetic Progression. Journal of Symbolic Computation 9(3): 251-280, 1990. Special Issue on Computational Algebraic Complexity.
7. Cormen, T.H., C.E. Leiserson and R.L. Rivest. Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
8. Davey, B.A. and H.A. Priestley. Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
9. Fall, A. Reasoning with Taxonomies. Ph.D. thesis, Simon Fraser University, 1996.
10. Ganguly, D., C. Mohan and S. Ranka. A Space-and-Time-Efficient Coding Algorithm for Lattice Computations. IEEE Transactions on Knowledge and Data Engineering 6(5): 819-829, 1994.
11. Mellish, C. Implementing Systemic Classification by Unification. Computational Linguistics 14(1), 40-51, 1988.
12. Mellish, C. Term-Encodable Description Spaces. In D. Brough, editor, Logic Programming: New Frontiers, 189-207. Kluwer, Dordrecht, 1992.
13. Penn, G. The Algebraic Structure of Attributed Type Signatures. Ph.D. thesis, Carnegie Mellon University, 2000.
14. Pollard, C. and I. Sag. Information-Based Syntax and Semantics, No. 13 in CSLI Lecture Notes. CSLI, Stanford, CA, 1987.
15. Pollard, C. and I. Sag. Head-Driven Phrase Structure Grammar, University of Chigaco Press, Chicago, 1994.
16. 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.
17. Smolka, G. A Feature Logic with Subsorts. Technical Report LILOG 33, IBM Germany, Stuttgart, 1988.
18. Strassen, V. Gaussian Elimination is not Optimal. Numerische Mathematik, 14(3): 354-356, 1969.
19. Warshall, S. A Theorem on Boolean Matrices. Journal of the ACM, 9(1): 11-12, 1962.