3009 search results - page 206 / 602 » The Expressive Rate of Constraints |
162
click to vote
IJCAI
1993
15 years 7 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
166
click to vote
AIPS
2009
15 years 7 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
146
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
137
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Here, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy wh...
187
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We introduce pairwise cardinality networks, networks of comparators, derived from pairwise sorting networks, which express cardinality constraints. We show that pairwise ...