4524 search results - page 279 / 905 » The Complexity of Global Constraints |
208
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
188
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
181
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic