Abstract
One very fertile domain of applied Artificial Intelligence is constraint solving technologies. Especially, constraint networks that concern problems that can be represented using discrete variables, together with constraints on allowed instantiation values for these variables. Every solution to a constraint network must satisfy every constraint. When no solution exists, the user might want to know the actual reasons leading to the absence of global solution. In this respect, extracting mucs (Minimal Unsatisfiable Cores) from an unsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become satisfiable. Despite bad worst-case computational complexity results, various muc-finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each main iteration step. In the general constraint networks setting, the approach is shown to outperform a technique based on a form of model rotation imported from the sat-related technology and that also exhibits additional transition constraints. Our extensive computational experimentations show that this enhancement also boosts the performance of state-of-the-art DC(WCORE)-like MUC extractors.
Similar content being viewed by others
Notes
The d o m/w d e g scores collected during the WCORE step are used to rank-order constraints.
The benchmarks are available at http://www.cril.univ-artois.fr/~lecoutre
Third international CSP solver competition. http://cpai.ucc.ie/08/ 2008
Fourth international constraint solver competition. http://cpai.ucc.ie/09/ 2009
The executable is available at http://www.cril.univ-artois.fr/~lagniez
References
Audemard G, Lagniez JM, Mazure B, Saïs L (2010) Boosting local search thanks to CDCL. In: Proceedings of the 17th international conference on logic for programming, artificial intelligence and reasoning (LPAR’2010), lecture notes in computer science, vol 6397. Springer-Verlag, Berlin, pp 474–488
Bakker RR, Dikker F, Tempelman F, Wognum PM (1993) Diagnosing and solving over-determined constraint satisfaction problems. In: Proceedings of the 13th international joint conference on artificial intelligence (IJCAI’93), vol 1. AAAI Press/International Joint Conferences on Artificial Intelligence, Menlo Park, pp 276–281. citeseer.ist.psu.edu/bakker93diagnosing.html
Belov A, Lynce I, Marques-Silva J (2012) Towards efficient MUS extraction. AI Commun 25:97–116
Belov A, Marques-Silva J (2011) Accelerating MUS extraction with recursive model rotation. In: Proceedings of the international conference on formal methods in computer-aided design (FMCAD’2011)
Belov A, Marques-Silva J. (2012) MUSer2 An efficient MUS extractor, system description. J Satisfiability Boolean Model Comput JSAT 8:123–128
Eiter T, Gottlob G (1992) On the complexity of propositional knowledge base revision, updates and counterfactual. Artif Intell 57: 227–270
Grégoire É, Lagniez JM, Mazure B (2011) A CSP solver focusing on FAC variables.In:Proceedingsofthe17thinternationalconferenceonprinciplesandpracticeofconstraintprogramming(CP’2011), lecture notes in computer science, vol 6878. Springer, Heidelberg, pp 493–507
Grégoire É, Mazure B, Piette C (2006) Extracting MUSes. In: 17th european conference on artificial intelligence (ECAI’06), pp. 387–391
Grégoire É, Mazure B, Piette C (2007) Local-search extraction of MUSes. Constraints 12(3):325–344
Grégoire É, Mazure B, Piette C (2008) On finding minimally unsatisfiable cores of CSPs. Int J Artif Intell Tools (IJAIT) 17(4):745–763
Grégoire É, Mazure B, Piette C, Saïs L (2006) A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs In: Proceedings of the IEEE international conference on information reuse and integration (IEEE-IRI’2006)
Hémery F, Lecoutre C, Saïs L, Boussemart F (2004) Boosting systematic search by weighting constraints. In: Proceedings of the 16th european conference on artificial intelligence (ECAI’2004)
Hémery F, Lecoutre C, Saïs L, Boussemart F (2006) Extracting MUCs from constraint networks In: 17th European conference on artificial intelligence (ECAI’2006)
Junker U (2001) QuickXplain: Conflict detection for arbitrary constraint propagation algorithms In: IJCAI’01 Workshop on modelling and solving problems with constraints (CONS-1). citeseer.ist.psu.edu/junker01quickxplain.html
Junker U (2004) QuickXplain: Preferred explanations and relaxations for over-constrained problems In: Proceedings of the 19th national conference on artificial intelligence (AAAI’04)
Jussien N, Barichard V (2000) The PaLM system: explanation-based constraint programming In: Proceedings of TRICS: techniques for implementing constraint programming systems, a post-conference workshop of CP’00. citeseer.ist.psu.edu/jussien00palm.html
Laburthe F (2000) OCRE Project Team, T.: Choco: implementing a CP kernel In: Proceedings of TRICS: techniques for implementing constraint programming systems, a post-conference workshop of CP’00. URL www.choco-constraints.net
Lagniez JM, Grégoire É, Mazure B.A data structure boosting the performance of local search for CSP solving. In: International Conference on metaheuristics and nature inspired computing (META’12) (2012. (Paper also available from the authors’ webpages))
Lecoutre C (2009) Constraint Networks: Techniques and Algorithms. Wiley
Lynce I, Marques-Silva J (2004) On computing minimum unsatisfiable cores In: Proceedings of the 7th international conference on theory and applications of satisfiability testing (SAT’04) - Online Proceedings
Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8(1):99–118
Mouhoub M, Sukpan A (2012) Managing dynamic CSPs with preferences. Appl Intell 37(3):446–462
Mouhoub M, Sukpan A (2012) Conditional and composite temporal CSPs. Appl Intell 36(1):90–107
Marques-Silva J, IL (2011) On improving MUS extraction algorithms In: Proceedings of the 14th international conference on theory and applications of satisfiability testing (SAT’11), lecture notes in computer science, vol 6695. Springer, pp 159–173
Marques-Silva J, Janota M, Belov A (2013) Minimal sets over monotone predicates in boolean formulae In: Proceedings of the 25th international conference on computer aided verification (CAV’2013), lecture notes in computer science, vol 8044. Springer, pp 592–607
Marques-Silva J, Lynce I (2011) On improving MUS extraction algorithms In: Proceedings of the 14th international conference on theory and applications of satisfiability testing (SAT’11), lecture notes in computer science, vol 6695. Springer, pp 159–173
McAllester D, Selman B, Kautz HA (1997) Evidence for invariants in local search In: Fourteenth national conference on artificial intelligence (AAAI’97)
Morris P (1993) The breakout method for escaping from local minima In: Proceedings of the eleventh national conference on artificial intelligence (AAAI’1993). AAAI Press, pp 40–45
Papadimitriou CH, Wolfe D (1988) The complexity of facets resolved. J Comput Syst Sci 37(1):2–13
Rossi F, van Beek P, Walsh T (2006) Handbook of Constraint Programming. Elsevier, Amsterdam
Papadimitriou C H (1993) Computational complexity. Addison-Wesley, Reading, MA
Ryvchin V, Strichman O (2011) Faster extraction of high-level minimal unsatisfiable cores In: Proceedings of the 14th international conference on theory and applications of satisfiability testing (SAT’11), lecture notes in computer science, vol 6695. Springer, Heidelberg, pp 174–187
Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search In: Twelfth national conference on artificial intelligence (AAAI’1994)
de Siqueira NJ, Puget JF (1988) Explanation-based generalization of failures In: Proceedings of the eighth european conference on artificial intelligence (ECAI’88)
Van Maaren H, Wieringa S (2008) Finding guaranteed MUSes fast In: Proceedings of the 11th international conference on theory and applications of satisfiability testing (SAT’08), lecture notes in computer science, vol 4996. Springer, Heidelberg, pp 291–304
Wieringa S (2012) Understanding, improving and parallelizing MUS finding using model rotation In: 18th International conference on principles and practice of constraint programming (CP’2012), lecture notes in computer science, vol 7516. Springer, Heidelberg, pp 672–687
Acknowledgments
This work has been partly supported by a grant from the Rgion Nord/Pas-de-Calais and by an EC FEDER grant.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Grégoire, É., Lagniez, JM. & Mazure, B. Boosting MUC extraction in unsatisfiable constraint networks. Appl Intell 41, 1012–1023 (2014). https://doi.org/10.1007/s10489-014-0549-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-014-0549-6