Sciweavers

681 search results - page 20 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
LICS
1991
IEEE
14 years 1 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
PLDI
2011
ACM
13 years 27 days ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
ACL
2006
13 years 11 months ago
Combining Statistical and Knowledge-Based Spoken Language Understanding in Conditional Models
Spoken Language Understanding (SLU) addresses the problem of extracting semantic meaning conveyed in an utterance. The traditional knowledge-based approach to this problem is very...
Ye-Yi Wang, Alex Acero, Milind Mahajan, John Lee
MICS
2010
81views more  MICS 2010»
13 years 8 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
EACL
2006
ACL Anthology
13 years 11 months ago
Edit Machines for Robust Multimodal Language Processing
Multimodal grammars provide an expressive formalism for multimodal integration and understanding. However, handcrafted multimodal grammars can be brittle with respect to unexpecte...
Srinivas Bangalore, Michael Johnston