The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL

DOI10.1007/978-3-642-30743-0_4zbMath1357.68211OpenAlexW35348824MaRDI QIDQ2900507

Aaron Gottesman, Marcos Alvarez Gonzalez, Chitta R. Baral

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_4

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic of natural languages (03B65) Knowledge representation (68T30) Classical first-order logic (03B10) Natural language processing (68T50) Combinatory logic and lambda calculus (03B40)

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical methods in linguistics
• A unification algorithm for typed \(\bar\lambda\)-calculus
• Third order matching is decidable
• Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
• Decidability of higher-order matching
• Welfare Economics and Robinson Crusoe the Producer
• Higher Order   Matching is Undecidable
• The undecidability of unification in third order logic

This page was built for publication: The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL