380 search results - page 20 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
SARA
2007
Springer
14 years 1 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
DAGSTUHL
2007
13 years 9 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
CONSTRAINTS
1998
13 years 7 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
AI
2003
Springer
14 years 23 days ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...