In the quest of the best form of local consistency for Weighted CSP

The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during search for solving WCSP. We first refine the notions of directional arc consistency (DAC) and full directional arc consistency (FDAC) introduced in [Cooper, 2003] for binary WCSP, define algorithms that enforce these properties and study their complexities. We then consider algorithms that maintain either arc consistency (AC), DAC or FDAC during search. The efficiency of these algorithms is empirically studied. It appears that despite its high theoretical cost, the strongest FDAC property is the best choice.

• Type: Conference
• Year: 2003
• Where: IJCAI
• Authors: Javier Larrosa, Thomas Schiex
• Keywords: Arc Consistency, Directional Arc Consistency, IJCAI 2003, IJCAI 2007, Soft Constraint Framework