711 search results - page 65 / 143 » Amalgams of Constraint Satisfaction Problems |
134
Voted
EJC
2010
15 years 4 months ago
2010
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
131
click to vote
PPDP
2009
Springer
15 years 11 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...
127
click to vote
KBS
2007
15 years 4 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
127
click to vote
AAAI
2007
15 years 6 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...