The inverse lambda calculus algorithm for typed first order logic lambda calculus and its application to translating english to FOL

Chitta Baral, Marcos Alvarez Gonzalez, Aaron Gottesman

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

Abstract

In order to answer questions and solve problems that require deeper reasoning with respect to a given text, it is necessary to automatically translate English sentences to formulas in an appropriate knowledge representation language. This paper focuses on a method to translate sentences to First-Order Logic (FOL). Our approach is inspired by Montague's use of lambda calculus formulas to represent the meanings of words and phrases. Since our target language is FOL, the meanings of words and phrases are represented as FOL-lambda formulas. In this paper we present algorithms that allow one to construct FOL-lambda formulas in an inverse manner. Given a sentence and its meaning and knowing the meaning of several words in the sentence our algorithm can be used to obtain the meaning of the other words in that sentence. In particular the two algorithms take as input two FOL-lambda formulas G and H and compute a FOL-lambda formula F such that F with input G, denoted by F@G, is H; respectively, G@F = H. We then illustrate our algorithm and present soundness, completeness and complexity results, and briefly mention the use of our algorithm in a NL Semantics system that translates sentences from English to formulas in formal languages.

Original languageEnglish (US)
Title of host publicationCorrect Reasoning
Subtitle of host publicationEssays on Logic-Based AI in Honor of Vladimir Lifschitz
EditorsErdem Esra, Lee Joohyung, Lierler Yuliya, Pearce David
Pages40-56
Number of pages17
DOIs
StatePublished - Jul 30 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7265
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The inverse lambda calculus algorithm for typed first order logic lambda calculus and its application to translating english to FOL'. Together they form a unique fingerprint.

  • Cite this

    Baral, C., Gonzalez, M. A., & Gottesman, A. (2012). The inverse lambda calculus algorithm for typed first order logic lambda calculus and its application to translating english to FOL. In E. Esra, L. Joohyung, L. Yuliya, & P. David (Eds.), Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz (pp. 40-56). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7265). https://doi.org/10.1007/978-3-642-30743-0_4