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

Authors:
Chitta Baral;Juraj Dzifcak;Marcos a. Gonzalez;Aaron Gottesman
Affiliations:
School of computing, informatics, and decision systems engineeringarizona state university, tempe, az;School of computing, informatics, and decision systems engineeringarizona state university, tempe, az;School of computing, informatics, and decision systems engineeringarizona state university, tempe, az;School of computing, informatics, and decision systems engineeringarizona state university, tempe, az
Venue:
Theory and Practice of Logic Programming
Year:
2012

Citing 10
Cited 0

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
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
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
The inverse lambda calculus algorithm for typed first order logic lambda calculus and its application to translating english to FOL

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our broader goal is to automatically translate English sentences into formulas in appropriate knowledge representation languages as a step towards understanding and thus answering questions with respect to English text. Our focus in this paper is on the language of Answer Set Programming (ASP). Our approach to translate sentences to ASP rules is inspired by Montague's use of lambda calculus formulas as meaning of words and phrases. With ASP as the target language the meaning of words and phrases are ASP-lambda formulas. In an earlier work we illustrated our approach by manually developing a dictionary of words and their ASP-lambda formulas. However such an approach is not scalable. In this paper our focus is on two algorithms that allow one to construct ASP-lambda formulas in an inverse manner. In particular the two algorithms take as input two lambda-calculus expressions G and H and compute a lambda-calculus expression F such that F with input as G, denoted by F@G, is equal to H; and similarly G@F = H. We present correctness and complexity results about these algorithms. To do that we develop the notion of typed ASP-lambda calculus theories and their orders and use it in developing the completeness results.