1378 search results - page 16 / 276 » The Tractability of Global Constraints |
CONSTRAINTS
2007
14 years 11 months ago
2007
Abstract. The catalogue of global constraints is reviewed, focusing on the graph-based description of global constraints. A number of possible enhancements are proposed as well as ...
CONSTRAINTS
2007
14 years 11 months ago
2007
In this paper we give an overview of some industrial applications built using global constraints. We look at three systems from different application domains and show the core mo...
MST
2008
14 years 11 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...
113
click to vote
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...