711 search results - page 86 / 143 » Amalgams of Constraint Satisfaction Problems |
144
click to vote
AIPS
1994
15 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
164
Voted
CONSTRAINTS
2008
15 years 4 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
110
Voted
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
124
click to vote
AISC
2004
Springer
15 years 10 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
151
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...