Solving Mixed and Conditional Constraint Satisfaction Problems

  • Authors:

  • Esther Gelle;Boi Faltings

  • Affiliations:

  • Information Technologies Department, ABB Corporate Research Ltd., CH-5405 Baden-Daettwil, Switzerland esther.gelle@ch.abb.com;Artificial Intelligence Laboratory (LIA), Swiss Federal Institute of Technology (EPFL), CH-1015 Lausanne, Switzerland boi.faltings@epfl.ch

  • Venue:
  • Constraints
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constraints are a powerful general paradigm for representing knowledge in intelligent systems. The standard constraint satisfaction paradigm involves variables over a discrete value domain and constraints which restrict the solutions to allowed value combinations. This standard paradigm is inapplicable to problems which are either:(a) mixed, involving both numeric and discrete variables, or(b) conditional,1 containing variables whose existence depends on the values chosen for other variables, or(c) both, conditional and mixed.We present a general formalism which handles both exceptions in an integral search framework. We solve conditional problems by analyzing dependencies between constraints that enable us to directly compute all possible configurations of the CSP rather than discovering them during search. For mixed problems, we present an enumeration scheme that integrates numeric variables with discrete ones in a single search process. Both techniques take advantage of enhanced propagation rule for numeric variables that results in tighter labelings than the algorithms commonly used. From real world examples in configuration and design, we identify several types of mixed constraints, i.e. constraints defined over numeric and discrete variables, and propose new propagation rules in order to take advantage of these constraints during problem solving.