180 search results - page 20 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
108
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
108
click to vote
FLAIRS
2003
15 years 4 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
154
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
180
click to vote
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
129
click to vote
CISSE
2008
Springer
15 years 5 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...