Sciweavers

681 search results - page 21 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
ACL2
2006
ACM
15 years 3 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
PLDI
2012
ACM
13 years 2 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
79
Voted
LREC
2010
206views Education» more  LREC 2010»
14 years 11 months ago
FreeLing 2.1: Five Years of Open-source Language Processing Tools
FreeLing is an open-source multilingual language processing library providing a wide range of language analyzers for several languages. It offers text processing and language anno...
Lluís Padró, Miquel Collado, Samuel ...
ACL
2012
13 years 1 days ago
Collective Generation of Natural Image Descriptions
We present a holistic data-driven approach to image description generation, exploiting the vast amount of (noisy) parallel image data and associated natural language descriptions ...
Polina Kuznetsova, Vicente Ordonez, Alexander C. B...
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote