2981 search results - page 473 / 597 » Answer Set Planning |
180
click to vote
STACS
2012
Springer
14 years 1 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
185
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
222
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
156
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
162
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The understanding of Semantic Web documents is built upon ontologies that define concepts and relationships of data. Hence, the correctness of ontologies is vital. Ontology reason...