Solving Difficult CSPs with Relational Neighborhood Inverse Consistency

Authors

Robert J. Woodward, University of Nebraska-LincolnFollow
Shant Karakashian, University of Nebraska-LincolnFollow
Berthe Y. Choueiry, University of Nebraska-LincolnFollow
Christian Bessiere, University of Montpellier, FranceFollow

Date of this Version

2011

Comments

Woodward, Karakashian, Choueiry & Bessiere in 25th AAAI Conference on Artificial Intelligence (AAAI '11). Pages 112-119. Copyright 2011, AAAI Press. Used by permission.

Abstract

•Introduction

•Relational Neighborhood Inverse Consistency

–Property, Algorithm, Improvements

•Reformulating the Dual Graph by

1.Redundancy removal ⟿ property wRNIC

2.Triangulation ⟿ property triRNIC

•Selection strategy: four alternative dual graphs

•Experimental Results

•Conclusion