Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning

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

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

Volume 8656 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Schneider A., Woodward R.J., Choueiry B.Y., Bessiere C. (2014) Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning. In: O’Sullivan B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham

Abstract

Relational consistency algorithms are instrumental for solving difficult instances of Constraint Satisfaction Problems (CSPs), often allowing backtrack-free search. In this paper, we improve an algorithm for enforcing relational consistency by exploiting the property that the constraints of the dual encoding of a CSP are piecewise functional. This property allows us to partition a CSP relation into blocks of equivalent tuples at varying levels of granularity. Our new algorithm dynamically exploits those partitions. Our experiments show a significant improvement of the processing time for enforcing relational consistency.

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

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