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

DOI10.1017/S1471068412000282zbMath1261.68041OpenAlexW2165348932MaRDI QIDQ4911148

Juraj Dzifcak, Marcos Alvarez Gonzalez, Aaron Gottesman, Chitta R. Baral

Publication date: 13 March 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068412000282

zbMATH Keywords

lambda calculusanswer set programmingnatural language understandinginverse lambda algorithms

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Uses Software

• Automath

Cites Work

• Unnamed Item
• Third order matching is decidable
• Welfare Economics and Robinson Crusoe the Producer
• Higher Order   Matching is Undecidable
• The undecidability of unification in third order logic
• A formulation of the simple theory of types

This page was built for publication: Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them