Skip to Main content Skip to Navigation
Conference papers

Global Inverse Consistency for Interactive Constraint Satisfaction

Abstract : Some applications require the interactive resolution of a constraint problem by a human user. In such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to solutions. We call this property global inverse consistency. Existing systems simulate this either by maintaining arc consistency after each assignment performed by the user or by compiling offline the problem as a multi-valued decision diagram. In this paper, we define several questions related to global inverse consistency and analyse their complexity. Despite their theoretical intractability, we propose several algorithms for enforcing global inverse consistency and we show that the best version is efficient enough to be used in an interactive setting on several configuration and design problems. We finally extend our contribution to the inverse consistency of tuples.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) Connect in order to contact the contributor
Submitted on : Thursday, April 30, 2015 - 10:05:08 AM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Monday, September 14, 2015 - 4:11:12 PM


Files produced by the author(s)


  • HAL Id : hal-01147298, version 1
  • OATAO : 12766


Christian Bessière, Hélène Fargier, Christophe Lecoutre. Global Inverse Consistency for Interactive Constraint Satisfaction. CP: Principles and Practice of Constraint Programming, Sep 2013, Uppsala, Sweden. pp.159-174. ⟨hal-01147298⟩



Record views


Files downloads