Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
نویسندگان
چکیده
منابع مشابه
Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them
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 for...
متن کاملTyped Answer Set Programming Lambda Calculus Theories and Correctness of Inverse Lambda Algorithms with respect to them published in Theory and Practice of Logic Programming
Appendix A Before presenting the theorems and proofs, we will present several necessary definitions .
متن کاملTyped Answer Set Programming and Inverse Lambda Algorithms
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 for...
متن کاملUsing Answer Set Programming and Lambda Calculus to Characterize Natural Language Sentences with Normatives and Exceptions
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 ...
متن کاملSemantics of Typed Lambda-Calculus with Constructors
Gödel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two disciplines. Following a previous work [3], we consider an extension of the original ludics with contraction and universal nondeterminism, which play dual roles,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2012
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068412000282