Abstract
Existing algorithms for minimal unsatisfiable subset (MUS) extraction are defined independently of any symbolic information, and in current implementations domain experts mostly do not have a chance to influence the extraction process based on their knowledge about the encoded problem. The MUStICCa tool introduces a novel graphical user interface for interactive deletion-based MUS finding, allowing the user to inspect and influence the structure of extracted MUSes.
The tool is centered around an explicit visualization of the explored part of the search space, representing unsatisfiable subsets (USes) as selectable states. While inspecting the contents of any US, the user can select candidate clauses to initiate deletion attempts. The reduction steps can be enhanced by a range of state-of-the-art techniques such as clause-set refinement, model rotation, and autarky reduction. MUStICCa compactly represents the criticality information derived for the different USes in a shared data structure, which leads to significant savings in the number of solver calls when multiple MUSes are explored. For automatization, our tool includes a reduction agent mechanism into which arbitrary user-implemented deletion heuristics can be plugged.
This work was supported by DFG-SPP 1307, project “Structure-based Algorithm Engineering for SAT-Solving”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bakker, R.R., Dikker, F., Tempelman, F., Wognum, P.: Diagnosing and Solving Over-Determined Constraint Satisfaction Problems. In: Proceedings of IJCAI 1993, pp. 276–281. Morgan Kaufmann (1993)
Belov, A., Ivrii, A., Matsliah, A., Marques-Silva, J.: On Efficient Computation of Variable MUSes. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 298–311. SAT, Heidelberg (2012)
Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97–116 (2012)
Chinneck, J.W., Dravnieks, E.W.: Locating Minimal Infeasible Constraint Sets in Linear Programs. INFORMS Journal on Computing 3(2), 157–168 (1991)
Dellert, J.: Interactive Extraction of Minimal Unsatisfiable Cores Enhanced By Meta Learning. Diplomarbeit, Universität Tübingen (2013)
Desrosiers, C., Galinier, P., Hertz, A., Paroz, S.: Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18(2), 124–150 (2009)
Evang, K., Dellert, J.: Kahina - Trac. Web (2013), http://www.kahina.org/trac
Kullmann, O.: On the use of autarkies for satisfiability decision. Electronic Notes in Discrete Mathematics 9, 231–253 (2001)
Liffiton, M.: Mark Liffiton - CAMUS. Web (2013), http://sun.iwu.edu/~mliffito/camus (access date: January 22, 2013)
Liffiton, M.H., Malik, A.: Enumerating Infeasibility: Finding Multiple MUSes Quickly. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 160–175. Springer, Heidelberg (2013)
Nadel, A.: Boosting minimal unsatisfiable core extraction. In: FMCAD, pp. 221–229 (2010)
Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: DAC, pp. 518–523 (2004)
Ryvchin, V., Strichman, O.: Faster Extraction of High-Level Minimal Unsatisfiable Cores. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 174–187. Springer, Heidelberg (2011)
Silva, J.P.M.: Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper). In: ISMVL, pp. 9–14 (2010)
Sinz, C., Kaiser, A., Küchlin, W.: Formal Methods for the Validation of Automotive Product Configuration Data. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 17(1), 75–97 (2003); special issue on configuration
The SAT association: The international SAT Competitions web page. Web (2011), http://www.satcompetition.org/
Wieringa, S.: Understanding, Improving and Parallelizing MUS Finding Using Model Rotation. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 672–687. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dellert, J., Zielke, C., Kaufmann, M. (2013). MUStICCa: MUS Extraction with Interactive Choice of Candidates. In: Järvisalo, M., Van Gelder, A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39071-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-39071-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39070-8
Online ISBN: 978-3-642-39071-5
eBook Packages: Computer ScienceComputer Science (R0)