392 search results - page 22 / 79 » Negation as Partial Failure |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
SLP
1993
13 years 9 months ago
1993
We try to assess to what extent declarative programming can be realized in Prolog and which aspects of correctness of Prolog programs can be dealt with by means of declarative int...
IWC
2007
13 years 7 months ago
2007
This paper presents an investigation of the self-serving biases of interface agent users. An experiment that involved 202 MS Office users demonstrated that, in contrast to the sel...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
LOPSTR
2005
Springer
14 years 1 months ago
2005
Springer
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...