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

Authors:
Chita Baral;Juraj Dzifcak;Tran Cao Son
Affiliations:
School of Computing and Informatics, Arizona State University, Tempe, AZ;School of Computing and Informatics, Arizona State University, Tempe, AZ;Computer Science Department, New Mexico State University, Las Cruces, NM
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Year:
2008

Citing 8
Cited 5

The syntactic process

The syntactic process
Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Definability of Polyadic Lifts of Generalized Quantifiers

Journal of Logic, Language and Information
Recognising textual entailment with logical inference

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
AceRules: executing rules in controlled natural language

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Towards overcoming the knowledge acquisition bottleneck in answer set prolog applications: embracing natural language inputs

ICLP'07 Proceedings of the 23rd international conference on Logic programming

Transforming controlled natural language biomedical queries into answer set programs

BioNLP '09 Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing
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
Combining answer set programming and prolog: the ASP-PROLOG system

Logic programming, knowledge representation, and nonmonotonic reasoning
The inverse lambda calculus algorithm for typed first order logic lambda calculus and its application to translating english to FOL

Correct Reasoning
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

One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especially ones that are appropriate to express domain knowledge in sciences, such as Biology. While there have been several proposals, including by Montague (1970), to give model theoretic semantics for natural language and to translate natural language sentences and discourses to classical logic, none of these approaches use knowledge representation languages that can express domain knowledge involving normative statements and exceptions. In this paper we take a first step to illustrate how one can automatically translate natural language sentences about normative statements and exceptions to representations in the knowledge representation language Answer Set Programming (ASP). To do this, we use λ-calculus representation of words and their composition as dictated by a CCG grammar.