705 search results - page 15 / 141 » Approximating Extended Answer Sets |
100
click to vote
SIGMOD
2006
ACM
15 years 3 months ago
2006
ACM
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
106
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
ESWS
2005
Springer
15 years 3 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
125
click to vote
WG
2004
Springer
15 years 3 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
ISIPTA
2003
IEEE
15 years 2 months ago
2003
IEEE
Set-valued estimation offers a way to account for imprecise knowledge of the prior distribution of a Bayesian statistical inference problem. The set-valued Kalman filter, which p...