Sciweavers

838 search results - page 129 / 168
» From Natural Language to Formal Proof Goal
Sort
View
JMLR
2012
13 years 8 months ago
Joint Learning of Words and Meaning Representations for Open-Text Semantic Parsing
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
Antoine Bordes, Xavier Glorot, Jason Weston, Yoshu...
ACL
1997
15 years 7 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
RAS
2010
164views more  RAS 2010»
15 years 4 months ago
Towards performing everyday manipulation activities
This article investigates fundamental issues in scaling autonomous personal robots towards open-ended sets of everyday manipulation tasks which involve high complexity and vague j...
Michael Beetz, Dominik Jain, Lorenz Mösenlech...
185
Voted
SIGSOFT
2007
ACM
16 years 6 months ago
SLEDE: lightweight verification of sensor network security protocol implementations
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
Youssef Hanna
POPL
2010
ACM
16 years 3 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...