705 search results - page 57 / 141 » Approximating Extended Answer Sets |
TACAS
2005
Springer
15 years 3 months ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
128
click to vote
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
104
click to vote
CI
2004
14 years 9 months ago
2004
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
196
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...