{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:07Z","timestamp":1725488887718},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422518"},{"type":"electronic","value":"9783540457381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45738-0_4","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T15:40:39Z","timestamp":1186760439000},"page":"48-69","source":"Crossref","is-referenced-by-count":1,"title":["Computational and Structural Aspects of Openly Specified Type Hierarchies"],"prefix":"10.1007","author":[{"given":"Stephen J.","family":"Hegner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(86)90047-2","volume":"45","author":"H. A\u00eft-Kaci","year":"1986","unstructured":"A\u00eft-Kaci, H. An algebraic semantics approach to the effctive resolution of type equations. Theoret. Comput. Sci., 45:293\u2013351, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/59287.59293","volume":"11","author":"H. A\u00eft-Kaci","year":"1989","unstructured":"A\u00eft-Kaci, H., R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Trans. Programming Languages and Systems, 11:115\u2013146, 1989.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Briscoe, T., V. de Paiva, and A. Copestake, editors. Inheritance, Defaults, and the Lexicon. Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511663642"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Carpenter, B. The Logic of Typed Feature Structures. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511530098"},{"key":"4_CR5","unstructured":"Carpenter, B., and G. Penn. ALE: The Attribute Logic Engine user\u2019s guide, Version 3.1 Beta. Technical report, Bell Laboratories and Universit\u00e4t T\u00fcbingen, 1998."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Paiva, V. de. Types and constraints in the LKB. In T. Briscoe, V. de Paiva, and A. Copestake, editors, Inheritance, Defaults, and the Lexicon, pages 164\u2013189. Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511663642.010"},{"key":"4_CR7","unstructured":"D\u00f6rre, J., and M. Dorna. CUF-a formalism for linguistic knowledge representation. In D\u00f6rre, J., editor, Computational Aspects of Constraint-Based Linguistic Description, DYANA-2 Deliverable R.1.2.A, pages 3\u201322. ESPRIT, 1993."},{"key":"4_CR8","first-page":"100","volume":"2","author":"J. D\u00f6rre","year":"1990","unstructured":"D\u00f6rre, J., and A. Eisele. Feature logic with disjunctive unification. In Proceedin gs of the COLING 90, Volume 2, pages 100\u2013105, 1990.","journal-title":"Proceedin gs of the COLING 90"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W. F. Dowling","year":"1984","unstructured":"Dowling, W. F., and J. H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn clauses. J. Logic Programming, 3:267\u2013284, 1984.","journal-title":"J. Logic Programming"},{"key":"4_CR10","unstructured":"Enderton, H. B. A Mathematical Introduction to Logic. Academic Press, 1972."},{"key":"4_CR11","unstructured":"Garey, M. R., and D. S. Johnson. Computers and Intractability. W. H. Freeman, 1979."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gerdemann, D., and P. J. King. The correct and efficient implementation of appropriateness conditions for typed feature structures. In Proceedings of COLING-94,pages 956\u2013960, 1994.","DOI":"10.3115\/991250.991302"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e4tzer, G. itGeneral Lattice Theory. Academic Press, 1978.","DOI":"10.1007\/978-3-0348-7633-9"},{"key":"4_CR14","unstructured":"Hegner, S. J. Distributivity in incompletely specified type hierarchies: Theory and computational complexity. In J. D\u00f6rre, editor, Computational Aspects of Constraint-Based Linguistic Description II, DYANA-2, ESPRIT Basic Research Project 6852, Deliverable R1.2B, pages 29\u2013120. DYANA, 1994. Also available as LLI Technical Report No. 4, University of Oslo, Department of Linguistics."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hegner, S. J. Properties of Horn clauses in feature-structure logic. In Rupp, C. J., M. A. Rosner, and R. L. Johnson, editors, Constraints, Languages and Computation, pages 111\u2013147. Academic Press, 1994.","DOI":"10.1016\/B978-0-08-050296-0.50011-5"},{"key":"4_CR16","unstructured":"Herrlich, H., and G. E. Strecker. Category Theory. Allyn and Bacon, 1973."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Hochbaum, D. S., editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1997.","DOI":"10.1145\/261342.571216"},{"key":"4_CR18","unstructured":"Horowitz, E., S. Sahni, and S. Rajasekaran. Computer Algorithms. Computer Science Press, 1998."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1111\/j.1467-8640.1987.tb00176.x","volume":"3","author":"H. J. Levesque","year":"1987","unstructured":"Levesque, H. J., and R. J. Brachman. Expressiveness and tractability in knowledge representation. Computational Intelligence, 3:78\u201393, 1987.","journal-title":"Computational Intelligence"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/0022-0000(87)90027-4","volume":"34","author":"J. A. Makowsky","year":"1987","unstructured":"Makowsky, J. A. Why Horn formulas matter in cmputer science: Initial structures and generic examples. J. Comput. System Sci., 34:266\u2013292, 1987.","journal-title":"J. Comput. System Sci."},{"key":"4_CR21","unstructured":"Meurers, W. D. On implementing an hpsg theory-aspects of the logical architecture, the formalization, and the implementation of head-driven phrase structure grammars. In Hinrichs, E. W., W. D. Meurers, and T. Nakazawa, editors, Partial-VP and Split-NP Topicalization in German-An HPSG Analysis and its Implementation, volume 58 of Arbeitspapiere des SFB 340. University of T\u00fcbingen, 1994."},{"key":"4_CR22","unstructured":"Pollard, C., and I. A. Sag. Head-Driven Phrase Structure Grammar. University of Chicago Press, 1994."},{"key":"4_CR23","unstructured":"Selman, B., and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of IJCAI-93, pages 290\u2013295, 1993."},{"key":"4_CR24","unstructured":"Zajac, R. Notes on the Typed Feature System, Version 4, January 1991. Technical report, Universit\u00e4t Stuttgart, Institut f\u00fcr Informatik, Project Polygloss, 1991."}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45738-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T19:41:05Z","timestamp":1587843665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45738-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422518","9783540457381"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45738-0_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}