405 search results - page 24 / 81 » On the Complexity of Global Constraint Satisfaction |
PPDP
2009
Springer
15 years 5 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
90
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
103
click to vote
CP
2005
Springer
15 years 1 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
IJCAI
1993
15 years 11 days 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...