Reformulating the Dual Graphs of CSPs to Improve the Performance of RNIC

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

Document Type

Article

Comments

Woodward, Karakashian, Choueiry & Bessiere in Ninth International Symposium on Abstraction, Reformulation and Approximation (SARA) 2011. Pages 140-148. Copyright 2011, AAAI Press. Used by permission.

Abstract

•Introduction

•Relational Neighborhood Inverse Consistency

–Property & algorithm

•Reformulating the Dual Graph by

1.Removing redundant edges, yields property wRNIC

2.Triangulation, yields property triRNIC

•Selection strategy: four alternative dual graphs

•Experimental Results

•Conclusion