Detecting unsatisfiable CSPs by coloring the micro-structure

  • Authors:

  • Daya Ram Gaur;W. Ken Jackson;William S. Havens

  • Affiliations:

  • Intelligent Systems Lab, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Intelligent Systems Lab, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;Intelligent Systems Lab, School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada

  • Venue:
  • AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constraint satisfaction research has focussed on consistency checking using k-consistency ilnd its variations such as arc-consistency, and path-consistency. We define a new form of consistency checking that is based on coloring the micro-structure graph of a constraint satisfaction problem (CSP). In our formulation, if the micro-structure graph of a CSP with n variables can be colored with n - 1 colors then the problem is unsatisfiable. This new notion of consistency-by-coloring is compared to arc-consistency. We provide examples that show that neither arc-consistency. nor consistency-by-coloring is more powerful than the other in a theoretical sense. We also describe the results of preliminary computational experiments that compare consistency-by-coloring and arc-consistency.