{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:42:12Z","timestamp":1755218532141,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Grammars"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1009969528224","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"295-312","source":"Crossref","is-referenced-by-count":3,"title":["The Algebraic Structure of Transitive Closure and its Application to Attributed Type Signatures"],"prefix":"10.1007","volume":"3","author":[{"given":"Gerald","family":"Penn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"310463_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., J. Hopcroft and J. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974"},{"issue":"1","key":"310463_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Ka\u0107i","year":"1989","unstructured":"A\u00eft-Ka\u0107i, H., R. Boyer, P. Lincoln and R. Nasr. Efficient Implementation of Lattice Operations. ACM Transactions on Programming Languages and Systems11(1): 115\u2013146, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"310463_CR3","volume-title":"A Practical Introduction to Denotational Semantics","author":"L. Allison","year":"1986","unstructured":"Allison, L. A Practical Introduction to Denotational Semantics, Cambridge University Press, Cambridge, 1986."},{"key":"310463_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530098","volume-title":"The Logic of Typed Feature Structures","author":"B. Carpenter","year":"1992","unstructured":"Carpenter, B. The Logic of Typed Feature Structures, Cambridge University Press, Cambridge, 1992."},{"key":"310463_CR5","volume-title":"Recent Advances in Parsing Technologies","author":"B. Carpenter","year":"1996","unstructured":"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."},{"issue":"3","key":"310463_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D. and S. Winograd. Matrix Multiplication via Arithmetic Progression. Journal of Symbolic Computation9(3): 251\u2013280, 1990. Special Issue on Computational Algebraic Complexity.","journal-title":"Journal of Symbolic Computation"},{"key":"310463_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., C.E. Leiserson and R.L. Rivest. Introduction to Algorithms, MIT Press, Cambridge, MA, 1990."},{"key":"310463_CR8","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A. and H.A. Priestley. Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990."},{"key":"310463_CR9","unstructured":"Fall, A. Reasoning with Taxonomies. Ph.D. thesis, Simon Fraser University, 1996."},{"issue":"5","key":"310463_CR10","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/69.317709","volume":"6","author":"D. Ganguly","year":"1994","unstructured":"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\u2013829, 1994.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"310463_CR11","first-page":"40","volume":"14","author":"C. Mellish","year":"1988","unstructured":"Mellish, C. Implementing Systemic Classification by Unification. Computational Linguistics14(1), 40\u201351, 1988.","journal-title":"Computational Linguistics"},{"key":"310463_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-94-011-2562-8_9","volume-title":"Logic Programming: New Frontiers","author":"C. Mellish","year":"1992","unstructured":"Mellish, C. Term-Encodable Description Spaces. In D. Brough, editor, Logic Programming: New Frontiers, 189\u2013207. Kluwer, Dordrecht, 1992."},{"key":"310463_CR13","unstructured":"Penn, G. The Algebraic Structure of Attributed Type Signatures. Ph.D. thesis, Carnegie Mellon University, 2000."},{"key":"310463_CR14","series-title":"CSLI Lecture Notes","volume-title":"Information-Based Syntax and Semantics","author":"C. Pollard","year":"1987","unstructured":"Pollard, C. and I. Sag. Information-Based Syntax and Semantics, No. 13 in CSLI Lecture Notes. CSLI, Stanford, CA, 1987."},{"key":"310463_CR15","volume-title":"Head-Driven Phrase Structure Grammar","author":"C. Pollard","year":"1994","unstructured":"Pollard, C. and I. Sag. Head-Driven Phrase Structure Grammar, University of Chigaco Press, Chicago, 1994."},{"key":"310463_CR16","doi-asserted-by":"crossref","unstructured":"Prosser, R.T. Applications of Boolean Matrices to the Analysis of Flow Diagrams. In Proceedings of the 16th Eastern Joint Computer Conference, 133\u2013138, 1959.","DOI":"10.1145\/1460299.1460314"},{"key":"310463_CR17","series-title":"Technical Report LILOG","volume-title":"A Feature Logic with Subsorts","author":"G. Smolka","year":"1988","unstructured":"Smolka, G. A Feature Logic with Subsorts. Technical Report LILOG 33, IBM Germany, Stuttgart, 1988."},{"issue":"3","key":"310463_CR18","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"14","author":"V. Strassen","year":"1969","unstructured":"Strassen, V. Gaussian Elimination is not Optimal. Numerische Mathematik, 14(3): 354\u2013356, 1969.","journal-title":"Numerische Mathematik"},{"issue":"1","key":"310463_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S. A Theorem on Boolean Matrices. Journal of the ACM, 9(1): 11\u201312, 1962.","journal-title":"Journal of the ACM"}],"container-title":["Grammars"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009969528224.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009969528224\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009969528224.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T05:49:22Z","timestamp":1754459362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009969528224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["310463"],"URL":"https:\/\/doi.org\/10.1023\/a:1009969528224","relation":{},"ISSN":["1386-7393","1572-848X"],"issn-type":[{"type":"print","value":"1386-7393"},{"type":"electronic","value":"1572-848X"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}