Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs

Abstract

Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to non-binary CSPs, and describe a practical algorithm for enforcing it. We propose an adaptive strategy to weaken or strengthen this property based on the connectivity of the network. We demonstrate the effectiveness of RNIC as a full lookahead strategy during search for solving difficult benchmark problems.

Cite

Text

Woodward et al. "Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.8059

Markdown

[Woodward et al. "Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/woodward2011aaai-adaptive/) doi:10.1609/AAAI.V25I1.8059

BibTeX

@inproceedings{woodward2011aaai-adaptive,
  title     = {{Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs}},
  author    = {Woodward, Robert J. and Karakashian, Shant and Choueiry, Berthe Y. and Bessiere, Christian},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {1830-1831},
  doi       = {10.1609/AAAI.V25I1.8059},
  url       = {https://mlanthology.org/aaai/2011/woodward2011aaai-adaptive/}
}