{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:34:56Z","timestamp":1725593696908},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222207"},{"type":"electronic","value":"9783642222214"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22221-4_2","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T14:27:18Z","timestamp":1309012038000},"page":"17-32","source":"Crossref","is-referenced-by-count":3,"title":["Using Logic in the Generation of Referring Expressions"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Areces","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Figueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gor\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Areces, C., Koller, A., Striegnitz, K.: Referring expressions as formulas of description logic. In: Proc. of the 5th INLG, Salt Fork, OH, USA (2008)","DOI":"10.3115\/1708322.1708332"},{"volume-title":"The Description Logic Handbook: Theory, implementation and applications","year":"2003","key":"2_CR2","unstructured":"Baader, F., McGuiness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press, Cambridge (2003)"},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Dale, R.: Cooking up referring expressions. In: Proc. of the 27th ACL (1989)","DOI":"10.3115\/981623.981632"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Dale, R., Haddock, N.: Generating referring expressions involving relations. In: Proc. of the 5th EACL (1991)","DOI":"10.3115\/977180.977208"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Dale, R., Reiter, E.: Computational interpretations of the Gricean maxims in the generation of referring expressions. Cognitive Science 19 (1995)","DOI":"10.1207\/s15516709cog1902_3"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dale, R., Viethen, J.: Referring expression generation through attribute-based heuristics. In: Proc. of the 12th ENLG Workshop, pp. 58\u201365 (2009)","DOI":"10.3115\/1610195.1610204"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1162\/089120102317341765","volume":"28","author":"K. Deemter van","year":"2002","unstructured":"van Deemter, K.: Generating referring expressions: Boolean extensions of the incremental algorithm. Computational Linguistics\u00a028(1), 37\u201352 (2002)","journal-title":"Computational Linguistics"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"van Deemter, K., van der Sluis, I., Gatt, A.: Building a semantically transparent corpus for the generation of referring expressions. In: Proc. of the 4th INLG (2006)","DOI":"10.3115\/1706269.1706296"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci.\u00a0311, 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","volume-title":"Mathematical Logic","author":"H. Ebbinghaus","year":"1996","unstructured":"Ebbinghaus, H., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1996)"},{"key":"2_CR12","first-page":"114","volume":"8","author":"S. Figueira","year":"2010","unstructured":"Figueira, S., Gor\u00edn, D.: On the size of shortest modal descriptions. Advances in Modal Logic\u00a08, 114\u2013132 (2010)","journal-title":"Advances in Modal Logic"},{"key":"2_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. Freeman, New York (1979)"},{"key":"2_CR14","first-page":"453","volume-title":"Proc. of 36th Annual Symposium on Foundations of Computer Science","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. of 36th Annual Symposium on Foundations of Computer Science, pp. 453\u2013462. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"2_CR15","volume-title":"Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"Hopcroft, J.: An n log(n) algorithm for minimizing states in a finite automaton. In: Kohave, Z. (ed.) Theory of Machines and Computations. Academic Press, London (1971)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Horacek, H.: An algorithm for generating referential descriptions with flexible interfaces. In: Proc. of the 35th ACL, pp. 206\u2013213 (1997)","DOI":"10.3115\/976909.979644"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Krahmer, E., van Erk, S., Verleg, A.: Graph-based generation of referring expressions. Computational Linguistics 29(1) (2003)","DOI":"10.1162\/089120103321337430"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-77050-3_17","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"D. Saha","year":"2007","unstructured":"Saha, D.: An incremental bisimulation algorithm. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 204\u2013215. Springer, Heidelberg (2007)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Stone, M.: On identifying sets. In: Proc. of the 1st INLG (2000)","DOI":"10.3115\/1118253.1118270"},{"key":"2_CR21","unstructured":"Stone, M., Webber, B.: Textual economy through close coupling of syntax and semantics. In: Proc. of the 9th INLG Workshop, pp. 178\u2013187 (1998)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Viethen, J., Dale, R.: Algorithms for generating referring expressions: Do they do what people do? In: Proc. of the 4th INLG (2006)","DOI":"10.3115\/1706269.1706283"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22221-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T05:29:15Z","timestamp":1560317355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22221-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222207","9783642222214"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22221-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}