714 search results - page 32 / 143 » Lexicographically-ordered constraint satisfaction problems |
104
click to vote
ACST
2006
14 years 11 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
103
click to vote
AISC
2004
Springer
15 years 2 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
TCS
2010
14 years 8 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
81
Voted
AAAI
1996
14 years 11 months ago
1996
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
140
click to vote
IJIT
2004
14 years 11 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...