Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports

  • Robert J. Woodward
  • Anthony Schneider
  • Berthe Y. Choueiry
  • Christian Bessiere
Conference paper

DOI: 10.1007/978-3-319-10428-7_54

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8656)
Cite this paper as:
Woodward R.J., Schneider A., Choueiry B.Y., Bessiere C. (2014) Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports. In: O’Sullivan B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham

Abstract

Determining the appropriate level of local consistency to enforce on a given instance of a Constraint Satisfaction Problem (CSP) is not an easy task. However, selecting the right level may determine our ability to solve the problem. Adaptive parameterized consistency was recently proposed for binary CSPs as a strategy to dynamically select one of two local consistencies (i.e., AC and maxRPC). In this paper, we propose a similar strategy for non-binary table constraints to select between enforcing GAC and pairwise consistency. While the former strategy approximates the supports by their rank and requires that the variables domains be ordered, our technique removes those limitations. We empirically evaluate our approach on benchmark problems to establish its advantages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Robert J. Woodward
    • 1
    • 2
  • Anthony Schneider
    • 1
  • Berthe Y. Choueiry
    • 1
  • Christian Bessiere
    • 2
  1. 1.Constraint Systems LaboratoryUniversity of Nebraska-LincolnUSA
  2. 2.CNRSUniversity of MontpellierFrance

Personalised recommendations