Revisiting Neighborhood Inverse Consistency on Binary CSPs

  title={Revisiting Neighborhood Inverse Consistency on Binary CSPs},
  author={Robert J. Woodward and Shant Kirakos Karakashian and B. Choueiry and Christian Bessiere},
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary Constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structure of the dual graph of binary CSPs, and show how it can be arranged in a triangle-shaped grid. We then study, in this context, Relational Neighborhood Inverse Consistency (RNIC), which is a consistency property that we had introduced for non-binary CSPs [17]. We discuss how the… 
On Path Consistency for Binary Constraint Satisfaction Problems
A new algorithm for enforcing partial path consistency, σ-∆-PPC, is proposed, which generalizes features of the well-known algorithms DPC and PPC, and identifies and correct errors in the literature and settles an open question.
Higher-Level Consistencies: Where, When, and How Much
A simple, reactive, and effective strategy is proposed that monitors the performance of backtrack search and triggers a higher-level consistency as search thrashes and monitors the amount of updates caused by propagation and interrupts the process before it reaches a fixpoint.
Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning
An algorithm for enforcing relational consistency is improved by exploiting the property that the constraints of the dual encoding of a CSP are piecewise functional, which allows us to partition a C SP relation into blocks of equivalent tuples at varying levels of granularity.
Strengthening neighbourhood substitution
The notion of neighbourhood substitution can be strengthened in two distinct ways without increasing time complexity and the theoretical result that, unlike neighbourhood substitution, finding an optimal sequence of these new operations is NP-hard is shown.
Strong local consistency algorithms for table constraints
Experimental results demonstrate that the proposed algorithms are quite competitive with standard GAC algorithms like STR2 in some classes of problems with intersecting table constraints, being orders of magnitude faster in some cases.
Exploiting the Pruning Power of Strong Local Consistencies Through Parallelization
This work proposes a novel approach for the application of strong local consistencies (SLCs) that can improve their performance by largely preserving the speed-ups they offer in cases where they are successful, and eliminating the run time penalties in casesWhere they are unsuccessful.
Using Parallelization to Efficiently Exploit the Pruning Power of Strong Local Consistencies
This work proposes a novel approach for the application of strong local consistencies that can improve their performance by largely preserving the speed-ups they offer in cases where they are successful, and eliminating the run time penalties in casesWhere they are unsuccessful.
Visualizations to Summarize Search Behavior
A process that organizes search history by automatically recognizing qualitatively significant changes in the metrics that assess search performance, and introduces a criterion for quantifying change between two time instants and a summarization technique for organizing the history of search at controllable levels of abstraction.
Building Portfolios for Parallel Constraint Solving by Varying the Local Consistency Applied
A way to build porfolios for parallel solving by parameter zing the local consistency property applied during search is proposed for the first time and it is shown how this approach can result in the easy automatic generation of portfolios that display large performance variability.


Solving Difficult CSPs with Relational Neighborhood Inverse Consistency
This paper argues that defining RNIC on the dual graph unveils unsuspected opportunities to reduce the computational cost of the algorithm and increase its filtering effectiveness, and shows how to achieve those effects by modifying the topology of theDual graph, yielding new variations the RNIC property.
Conservative Dual Consistency
It is shown that Conservative DC (CDC, i.e. DC with only relations associated with the constraints of the network considered) is more powerful, in terms of filtering, than Conservative PC (CPC), and it is observed that enforcing CDC in a preprocessing stage can significantly speed up the resolution of hard structured instances.
Second-Order Consistencies
It is shown that enforcing (C)DC before search clearly improves the performance of MAC (the algorithm that maintains GAC during search) on several binary and non-binary structured problems.
A First Practical Algorithm for High Levels of Relational Consistency
It is empirically show that wR(*,m)C solves in a backtrack-free manner all the instances of some CSP benchmark classes, thus hinting at the tractability of those classes.
Domain Filtering Consistencies
This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains.
From Restricted Path Consistency to Max-Restricted Path Consistency
This paper proposes RPC2, a new RPC algorithm with O(end2) worst case time complexity and requiring less space than RPC1 in practice, and proposes and studies a Max-RPC algorithm based on AC-6 that was used for this comparison.
Neighborhood Inverse Consistency Preprocessing
A new form of consistency preprocessing, neighborhood inverse consistency, can achieve more problem pruning than the usual arc consistency pre processing in a cost effective manner.
A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation
The authors provide a polynomial algorithm for achieving pairwise consistency within the constraint-satisfaction problems (CSPs) framework; then they extend the class of polynomially solvable CSPs.
Some Practicable Filtering Techniques for the Constraint Satisfaction Problem
This paper studies and compares the ltering techniques that are more pruningful than arc consistency while leaving unchanged the set of constraints and can deal with large CSPs.