The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL
From MaRDI portal
Publication:2900507
DOI10.1007/978-3-642-30743-0_4zbMath1357.68211MaRDI 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
68T27: Logic in artificial intelligence
03B65: Logic of natural languages
68T30: Knowledge representation
03B10: Classical first-order logic
68T50: Natural language processing
03B40: Combinatory logic and lambda calculus
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item