711 search results - page 75 / 143 » Amalgams of Constraint Satisfaction Problems |
184
click to vote
AI
2012
Springer
14 years 11 days ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
127
click to vote
MST
2008
15 years 4 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
134
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
160
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
137
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...