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...
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
As Bayesian networks become widely accepted as a normative formalism for diagnosis based on probabilistic knowledge, they are applied to increasingly larger problem domains. These...
Yanping Xiang, Kristian G. Olesen, Finn Verner Jen...
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...