138 search results - page 6 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
96
Voted
AI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
AAAI
1994
14 years 10 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
CSCLP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
CP
1999
Springer
15 years 1 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
73
Voted
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...