Solving Difficult CSPs with Relational Neighborhood Inverse Consistency


  • Robert Woodward University of Nebraska-Lincoln
  • Shant Karakashian University of Nebraska-Lincoln
  • Berthe Choueiry University of Nebraska-Lincoln
  • Christian Bessiere University of Montpellier


Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a strong local consistency property for binary CSPs. While enforcing NIC can significantly filter the variables domains, the proposed algorithm is too costly to be used on dense graphs or for lookahead during search. In this paper, we introduce and characterize Relational Neighborhood Inverse Consistency (RNIC) as a local consistency property that operates on the dual graph of a non-binary CSP. We describe and characterize a practical algorithm for enforcing it. We argue that defining RNIC on the dual graph unveils unsuspected opportunities to reduce the computational cost of our algorithm and increase its filtering effectiveness. We show how to achieve those effects by modifying the topology of the dual graph, yielding new variations the RNIC property. We also introduce an adaptive strategy to automatically select the appropriate property to enforce given the connectivity of the dual graph. We integrate the resulting techniques as full lookahead strategies in a backtrack search procedure for solving CSPs, and demonstrate the effectiveness of our approach for solving known difficult benchmark problems.




How to Cite

Woodward, R., Karakashian, S., Choueiry, B., & Bessiere, C. (2011). Solving Difficult CSPs with Relational Neighborhood Inverse Consistency. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 112-119. Retrieved from



Constraints, Satisfiability, and Search