3368 search results - page 14 / 674 » The Complexity of Query Reliability |
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
LCC
1994
15 years 1 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
CCCG
2003
14 years 11 months ago
2003
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require â„...