{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:15:04Z","timestamp":1743131704103,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307423"},{"type":"electronic","value":"9783642307430"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30743-0_4","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T03:49:46Z","timestamp":1338608986000},"page":"40-56","source":"Crossref","is-referenced-by-count":0,"title":["The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL"],"prefix":"10.1007","author":[{"given":"Chitta","family":"Baral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos Alvarez","family":"Gonzalez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Gottesman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Gamut, L.T.F.: Logic, Language, and Meaning. The University of Chicago Press (1991)","DOI":"10.7208\/chicago\/9780226791678.001.0001"},{"key":"4_CR2","unstructured":"Blackburn, P., Bos, J.: Representation and Inference for Natural Language: A First Course in Computational Semantics. Center for the Study of Language (2005)"},{"key":"4_CR3","unstructured":"Zettlemoyer, L.S., Collins, M.: Online learning of relaxed ccg grammars for parsing to logical form. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 678\u2013687 (2007)"},{"key":"4_CR4","unstructured":"Baral, C., Dzifcak, J., Son, T.C.: Using answer set programming and lambda calculus to characterize natural language sentences with normatives and exceptions. In: AAAI 2008: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 818\u2013823 (2008)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Dzifcak, J., Scheutz, M., Baral, C., Schermerhorn, P.: What to do and how to do it: translating natural language directives into temporal and dynamic logic representation for goal management and action execution. In: Robotics and Automation, ICRA 2009, pp. 4163\u20134168 (2009)","DOI":"10.1109\/ROBOT.2009.5152776"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Clark, S., Curran, J.R.: Wide-coverage efficient statistical parsing with ccg and log-linear models. Computational Linguistics 33 (2007)","DOI":"10.1162\/coli.2007.33.4.493"},{"key":"4_CR7","unstructured":"Zettlemoyer, L.S., Collins, M.: Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars. In: 21th Annual Conference on Uncertainty in Artificial Intelligence, pp. 658\u2013666 (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Steedman, M.: The syntactic process. MIT Press (2000)","DOI":"10.7551\/mitpress\/6591.001.0001"},{"key":"4_CR9","unstructured":"Baral, C., Dzifcak, J., Gonzalez, M.A., Zhou, J.: Using inverse lambda and generalization to translate english to formal languages. In: Proceedings of the 9th International Conference on Computational Semantics, ICWS 2011 (2011) (to appear)"},{"key":"4_CR10","unstructured":"Montague, R.: Formal Philosophy. In: Selected Papers of Richard Montague. Yale University Press, New Haven (1974)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Barendregt, H.: Lambda Calculi with Types, Handbook of Logic in Computer Science, vol.\u00a0II. Oxford University Press (1992)","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"4_CR12","unstructured":"Hindley, J.: Introduction to Combinators and Lambda-Calculus. Cambridge University Press (1986)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hindley, J.: Basic Simple Type Theory. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511608865"},{"key":"4_CR14","unstructured":"Barbara, H., Partee, A.T.M., Wall, R.E.: Mathematical Methods in Linguistics. Kluwer Academic Publishers (1990)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Decidability of higher-order matching. To appear Logical Methods in Computer Science\u00a05(3) (2009)","DOI":"10.2168\/LMCS-5(3:2)2009"},{"issue":"2-3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0168-0072(94)90083-3","volume":"69","author":"G. Dowek","year":"1994","unstructured":"Dowek, G.: Third order matching is decidable. Annals of Pure and Applied Logic\u00a069(2-3), 135\u2013155 (1994)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/jigpal\/11.1.51","volume":"11","author":"R. Loader","year":"2003","unstructured":"Loader, R.: Higher-order beta-matching is undecidable. Logic Journal of IGPL\u00a011(1), 51\u201368 (2003)","journal-title":"Logic Journal of IGPL"},{"key":"4_CR18","unstructured":"Kanazawa, M.: Learning word-to-meaning mappings in logical semantics. In: Proceedings of the Thirteenth Amsterdam Colloquium, pp. 126\u2013131 (2001)"},{"key":"4_CR19","unstructured":"Kanazawa, M.: Computing word meanings by interpolation. In: Proceedings of the Fourteenth Amsterdam Colloquium, pp. 157\u2013162 (2003)"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(73)90301-X","volume":"22","author":"G. Huet","year":"1973","unstructured":"Huet, G.: The undecidability of unication in third order logic. Information and Control\u00a022(3), 257\u2013267 (1973)","journal-title":"Information and Control"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"Huet, G.: A unication algorithm for typed calculus. Theoretical Computer Science\u00a01, 27\u201357 (1975)","journal-title":"Theoretical Computer Science"},{"key":"4_CR22","unstructured":"Kwiatkowski, T., Zettlemoyer, L., Goldwater, S., Steedman, M.: Inducing probabilistic ccg grammars from logical form with higher-order unification. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP (2010)"}],"container-title":["Lecture Notes in Computer Science","Correct Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30743-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T22:35:12Z","timestamp":1713998112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30743-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307423","9783642307430"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30743-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}