Conference Publication Details
Mandatory Fields
Escamocher, Guillaume; Siala, Mohamed; O’Sullivan, Barry
CPAIOR 2018: International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP
Optional Fields
Constraint Satisfaction Problem (CSP) Artificial intelligence Computer programming Constraint theory Hardness Operations research Backtracking search Problem hardness Search spaces Show through Solution space
Delft, Netherlands
Many studies have been conducted on the complexity of Constraint Satisfaction Problem (CSP) classes. However, there exists little theoretical work on the hardness of individual CSP instances. In this context, the backdoor key fraction (BKF) [17] was introduced as a quantifier of problem hardness for individual satisfiable instances with regard to backtracking search. In our paper, after highlighting the weaknesses of the BKF, we propose a better characterization of the hardness of an individual satisfiable CSP instance based on the ratio between the size of the solution space and that of the search space. We formally show that our measure is negatively correlated with instance hardness. We also show through experiments that this measure evaluates more accurately the hardness of individual instances than the BKF.
Grant Details
Science Foundation Ireland
Grant Number SFI/12/RC/2289