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

Authors:
Chitta Baral;Marcos Alvarez Gonzalez;Aaron Gottesman
Affiliations:
School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ;School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ;School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ
Venue:
Correct Reasoning
Year:
2012

Citing 9
Cited 1

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Basic simple type theory

Basic simple type theory
The syntactic process

The syntactic process
Wide-coverage efficient statistical parsing with ccg and log-linear models

Computational Linguistics
Using answer set programming and lambda calculus to characterize natural language sentences with normatives and exceptions

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
What to do and how to do it: translating natural language directives into temporal and dynamic logic representation for goal management and action execution

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Inducing probabilistic CCG grammars from logical form with higher-order unification

EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Using inverse λ and generalization to translate English to formal languages

IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics

Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.