Sciweavers

1343 search results - page 42 / 269
» Learning to Complete Sentences
Sort
View
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
15 years 9 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
AAAI
1994
15 years 2 months ago
The Ups and Downs of Lexical Acquisition
We have implemented an incremental lexical acquisition mechanism that learns the meanings of previously unknown words from the context in which they appear, as a part of the proce...
Peter M. Hastings, Steven L. Lytinen
ICCTA
2007
IEEE
15 years 7 months ago
Semantic Analysis of 'to'
‘To’ is one of the most common lexemes in English (as found in 34% of the sentences in the Penn Tree Bank corpus). This paper describes the analysis of the sentences involving...
Ashish Francis Almeida, Rajat Kumar Mohanty, Pushp...
ICLP
2010
Springer
15 years 4 months ago
Circumscription and Projection as Primitives of Logic Programming
We pursue a representation of logic programs as classical first-order sentences. Different semantics for logic programs can then be expressed by the way in which they are wrapped...
Christoph Wernhard
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 1 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin