{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:49Z","timestamp":1767339469504,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_49","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"499-511","source":"Crossref","is-referenced-by-count":4,"title":["Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sch\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Alviano, M., Faber, W., Greco, G., Leone, N.: Magic sets for disjunctive datalog programs. Tech. rep., Universit\u00e0 della Calabria, Dipartimento di Matematica (2009)"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Baker, C.F., Fillmore, C.J., Lowe, J.B.: The Berkeley FrameNet Project. In: 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, pp. 86\u201390 (1998)","DOI":"10.3115\/980845.980860"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"49_CR4","unstructured":"Beavers, J.: Documentation: A CCG implementation for the LKB. Tech. rep., Stanford University, Center for the Study of Language and Information (2003)"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Beavers, J.: Type-inheritance combinatory categorial grammar. In: International Conference on Computational Linguistics, COLING 2004 (2004)","DOI":"10.3115\/1220355.1220364"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Bos, J.: Wide-coverage semantic analysis with boxer. In: Semantics in Text Processing, STEP, pp. 277\u2013286. College Publications (2008)","DOI":"10.3115\/1626481.1626503"},{"issue":"12","key":"49_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"49_CR8","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2 input language format (2012)"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Clark, S., Curran, J.R.: Log-linear models for wide-coverage CCG parsing. In: SIGDAT Conference on Empirical Methods in Natural Language Processing, EMNLP 2003 (2003)","DOI":"10.3115\/1119355.1119368"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Clark, S., Curran, J.R.: Parsing the WSJ using CCG and log-linear models. In: 42nd Annual Meeting of the Association for Computational Linguistics, ACL, pp. 104\u2013111 (2004)","DOI":"10.3115\/1218955.1218969"},{"issue":"4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1162\/coli.2007.33.4.493","volume":"33","author":"S. Clark","year":"2007","unstructured":"Clark, S., Curran, J.R.: Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics\u00a033(4), 493\u2013552 (2007)","journal-title":"Computational Linguistics"},{"key":"49_CR12","volume-title":"Programming Languages and Their Compilers","author":"J. Cocke","year":"1970","unstructured":"Cocke, J., Schwartz, J.T.: Programming Languages and Their Compilers. Courant Institute of Mathematical Sciences, New York (1970)"},{"key":"49_CR13","unstructured":"Djordjevic, B., Curran, J.R.: Efficient combinatory categorial grammar parsing. In: Proceedings of the 2006 Australasian Language Technology Workshop, ALTW, pp. 3\u201310 (2006)"},{"key":"49_CR14","unstructured":"Drescher, C., Walsh, T.: Modelling grammar constraints with answer set programming. In: International Conference on Logic Programming, vol.\u00a011, pp. 28\u201339 (2011)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Eisner, J.: Efficient normal-form parsing for combinatory categorial grammar. In: 34th Annual Meeting of the Association for Computational Linguistics, pp. 79\u201386. ACL (1996)","DOI":"10.3115\/981863.981874"},{"issue":"2","key":"49_CR16","first-page":"7","volume":"5","author":"W.N. Francis","year":"1979","unstructured":"Francis, W.N., Kucera, H.: Brown corpus manual. Letters to the Editor\u00a05(2), 7 (1979)","journal-title":"Letters to the Editor"},{"key":"49_CR17","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: International Joint Conference on Artificial Intelligence, pp. 386\u2013392 (2007)"},{"key":"49_CR18","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. International Logic Programming Conference and Symposium, ICLP, pp. 1070\u20131080 (1988)"},{"key":"49_CR19","unstructured":"Kasami, T.: An efficient recognition and syntax analysis algorithm for context-free languages. Tech. Rep. AFCRL-65-758, Air Force Cambridge Research Laboratory (1965)"},{"key":"49_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-01929-6_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Reformulating global grammar constraints. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 132\u2013147. Springer, Heidelberg (2009)"},{"key":"49_CR21","unstructured":"Lange, M., Lei\u00df, H.: To CNF or not to CNF? An efficient yet presentable version of the CYK algorithm. In: Informatica Didactica 8. Universit\u00e4t Potsdam (2009)"},{"key":"49_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-30743-0_30","volume-title":"Correct Reasoning","author":"Y. Lierler","year":"2012","unstructured":"Lierler, Y., Sch\u00fcller, P.: Parsing Combinatory Categorial Grammar via planning in Answer Set Programming. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol.\u00a07265, pp. 436\u2013453. Springer, Heidelberg (2012)"},{"key":"49_CR23","unstructured":"Lierler, Y., Sch\u00fcller, P.: Towards a tight integration of syntactic parsing with semantic disambiguation by means of declarative programming. In: Erk, K., Koller, A. (eds.) 10th International Conference on Computational Semantics (2013)"},{"key":"49_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intel.\u00a0138, 39\u201354 (2002)","journal-title":"Artif. Intel."},{"key":"49_CR25","doi-asserted-by":"crossref","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"49_CR26","unstructured":"Moot, R.: Proof Nets for Linguistic Analysis. Ph.D. thesis, Utrecht Institute of Linguistics OTS (2002)"},{"key":"49_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"49_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.-G. Quimper","year":"2007","unstructured":"Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"49_CR29","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6591.001.0001","volume-title":"The syntactic process","author":"M. Steedman","year":"2000","unstructured":"Steedman, M.: The syntactic process. MIT Press, London (2000)"},{"key":"49_CR30","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D.J.: Polynomial time parsing of combinatory categorial grammars. In: 28th Annual Meeting of the Association for Computational Linguistics, pp. 1\u20138 (1990)","DOI":"10.3115\/981823.981824"},{"key":"49_CR31","unstructured":"White, M., Baldridge, J.: Adapting chart realization to CCG. In: European Workshop on Natural Language Generation, EWNLG 2003 (2003)"},{"key":"49_CR32","doi-asserted-by":"crossref","unstructured":"Wittenburg, K.: Predictive combinators: a method for efficient processing of combinatory categorial grammars. In: 25th Annual Meeting of the Association for Computational Linguistics, ACL, pp. 73\u201380 (1987)","DOI":"10.3115\/981175.981186"},{"issue":"2","key":"49_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"D.H. Younger","year":"1967","unstructured":"Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control\u00a010(2), 189\u2013208 (1967)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T14:37:35Z","timestamp":1746023855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}