Complexity of Minimum-Size Arc-Inconsistency Explanations - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2022

Complexity of Minimum-Size Arc-Inconsistency Explanations


Explaining the outcome of programs has become one of the main concerns in AI research. In constraint programming, a user may want the system to explain why a given variable assignment is not feasible or how it came to the conclusion that the problem does not have any solution. One solution to the latter is to return to the user a sequence of simple reasoning steps that lead to inconsistency. Arc consistency is a well-known form of reasoning that can be understood by a human. We consider explanations as sequences of propagation steps of a constraint on a variable (i.e. the ubiquitous revise function in arc consistency algorithms) that lead to inconsistency. We characterize, on binary CSPs, cases for which providing a shortest such explanation is easy: when domains are Boolean or when variables have maximum degree two. However, these polynomial cases are tight. Providing a shortest explanation is NP-hard if the maximum degree is three, even if the number of variables is bounded, or if domain size is bounded by three. It remains NP-hard on trees, despite the fact that arc consistency is a decision procedure on trees. Finally, the problem is not FPT-approximable unless the Gap-ETH is false.
Fichier principal
Vignette du fichier
LIPIcs-CP-2022-9.pdf (792.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-03833388 , version 1 (28-10-2022)




Christian Bessiere, Clement Carbonnel, Martin Cooper, Emmanuel Hébrard. Complexity of Minimum-Size Arc-Inconsistency Explanations. CP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. pp.9:1 - 9:14, ⟨10.4230/LIPIcs.CP.2022.9⟩. ⟨lirmm-03833388⟩
117 View
66 Download



Gmail Mastodon Facebook X LinkedIn More