Sciweavers

MST
2008
124views more  MST 2008»
13 years 11 months ago
Complexity of Clausal Constraints Over Chains
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...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...