143 search results - page 3 / 29 » Query Order and the Polynomial Hierarchy |
ICLP
2004
Springer
13 years 11 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
ISMIS
2000
Springer
13 years 9 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
LICS
2009
IEEE
14 years 24 days ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
DOLAP
1999
ACM
13 years 10 months ago
1999
ACM
Recently numerous proposals for modelling and querying Multidimensional Databases (MDDB) are proposed. Among the still open problems there is a rigorous classification of the diff...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...