Preserving Partial Solutions While Relaxing Constraint Networks

This paper is about transforming constraint networks to accommodate additional constraints in specific ways. The focus is on two intertwined issues. First, we investigate how partial solutions to an initial network can be preserved from the potential impact of additional constraints. Second, we study how more permissive constraints, which are intended to enlarge the set of solutions, can be accommodated in a constraint network. These two problems are studied in the general case and the light is shed on their relationship. A case study is then investigated where a more permissive additional constraint is taken into account through a form of network relaxation, while some previous partial solutions are preserved at the same time.

[1]  Joao Marques-Silva,et al.  MUSer2: An Efficient MUS Extractor , 2012, J. Satisf. Boolean Model. Comput..

[2]  Inês Lynce,et al.  On Improving MUS Extraction Algorithms , 2011, SAT.

[3]  P. M. Wognum,et al.  Diagnosing and Solving Over-Determined Constraint Satisfaction Problems , 1993, IJCAI.

[4]  Mikolás Janota,et al.  cmMUS: A Tool for Circumscription-Based MUS Membership Testing , 2011, LPNMR.

[5]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[6]  Eugene C. Freuder.  A constraints journal , 2004, Constraints.

[7]  Éric Grégoire,et al.  MUST: Provide a Finer-Grained Explanation of Unsatisfiability , 2007, CP.

[8]  Shie-Jue Lee,et al.  Deriving minimal conflict sets by CS-trees with mark set in diagnosis from first principles , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Kenneth N. Brown,et al.  Constraint Relaxation Techniques to Aid the Reuse of Knowledge Bases and Problem Solvers , 2003, SGAI Conf..

[10]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[11]  Georg Gottlob,et al.  On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..

[12]  Lakhdar Sais,et al.  Extracting MUCs from Constraint Networks , 2006, ECAI.

[13]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

[14]  Éric Grégoire.  International Journal on Artificial Intelligence Tools (IJAIT) , 2011 .

[15]  Andrew Josey.  Updates , 2003, login Usenix Mag..

[16]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[17]  Christian Bessiere,et al.  A General Conflict-Set Based Framework for Partial Constraint Satisfaction , 2008 .

[18]  Ulrich Junker.  Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .

[19]  Éric Grégoire,et al.  On Finding Minimally Unsatisfiable Cores of CSPS , 2008, Int. J. Artif. Intell. Tools.

[20]  Francesca Rossi,et al.  Constraint Retraction in CLP(FD): Formal Framework and Performance Results , 1999, Constraints.

[21]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[22]  Narendra Jussien,et al.  The PaLM system: explanation-based constraint programming , 2000 .

[23]  Joao Marques-Silva,et al.  Accelerating MUS extraction with recursive model rotation , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

[24]  Patrice Boizumault,et al.  Maintien de déduction pour la relaxation de contraintes , 1996, JFPLC.

[25]  Michela Milano.  Proceedings of the 18th international conference on Principles and Practice of Constraint Programming , 2012 .