1146 search results - page 220 / 230 » Finite cupping sets |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
Context-awareness is a highly desired feature across several application domains. Semantic Web Services (SWS) technologies address context-adaptation by enabling the automatic disc...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...