Abstract
Several AI problems can be conveniently modelled in ASP, and many of them require to enumerate solutions characterized by an optimality property that can be expressed in terms of subset-minimality with respect to some objective atoms. In this context, solutions are often either (i) answer sets or (ii) sets of atoms that enforce the absence of answer sets on the ASP program at hand—such sets are referred to as minimal unsatisfiable subsets (MUSes). In both cases, the required enumeration task is currently not supported by state-of-the-art ASP solvers.
This work is partially supported by the Italian Ministry of Research under PRIN project “exPlaInable kNowledge-aware PrOcess INTelligence” (PINPOINT), CUP H23C22000280006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alviano, M., Dodaro, C.: Model enumeration via assumption literals. Fundam. Informaticae 167(1–2), 31–58 (2019)
Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40–54. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23264-5_5
Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. Theory Pract. Log. Program. 14(4–5), 755–770 (2014). https://doi.org/10.1017/S1471068414000325
Alviano, M., Dodaro, C., Ricca, F.: A maxsat algorithm using cardinality constraints of bounded size. In: Proceedings of IJCAI, pp. 2677–2683. AAAI Press (2015). http://ijcai.org/Abstract/15/379
Amendola, G., Dodaro, C., Faber, W., Ricca, F.: Paracoherent answer set computation. Artif. Intell. 299, 103519 (2021). https://doi.org/10.1016/j.artint.2021.103519
Brewka, G., Delgrande, J.P., Romero, J., Schaub, T.: Asprin: Customizing answer set preferences without a headache. In: Proceefings of AAAI. pp. 1467–1474. AAAI Press (2015). http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9535
Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011). https://doi.org/10.1145/2043174.2043195
Brewka, G., Thimm, M., Ulbricht, M.: Strong inconsistency. Artif. Intell. 267, 78–117 (2019). https://doi.org/10.1016/j.artint.2018.11.002
Di Rosa, E., Giunchiglia, E., Maratea, M.: Solving satisfiability problems with preferences. Constraints An Int. J. 15(4), 485–515 (2010). https://doi.org/10.1007/s10601-010-9095-y
Dodaro, C., Gasteiger, P., Reale, K., Ricca, F., Schekotihin, K.: Debugging non-ground ASP programs: Technique and graphical tools. Theory Pract. Log. Program. 19(2), 290–316 (2019). https://doi.org/10.1017/S1471068418000492
Dodaro, C., Previti, A.: Minipref: A tool for preferences in SAT (short paper). In: Proceedings of RCRA. CEUR Workshop Proceedings, vol. 2538. CEUR-WS.org (2019)
Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53–68 (2016). https://doi.org/10.1609/aimag.v37i3.2678
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: Proceedings of ICLP (TC). OASICS, vol. 52, pp. 2:1–2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 136–148. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72200-7_13
Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52–89 (2012). https://doi.org/10.1016/j.artint.2012.04.001
Gebser, M., Leone, N., Maratea, M., Perri, S., Ricca, F., Schaub, T.: Evaluation techniques and systems for answer set programming: a survey. In: Proceedings of IJCAI, pp. 5450–5456. ijcai.org (2018). https://doi.org/10.24963/ijcai.2018/769
Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: Proceedings of AAAI, pp. 167–172. AAAI Press/The MIT Press (2004). http://www.aaai.org/Library/AAAI/2004/aaai04-027.php
Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints 21(2), 223–250 (2015). https://doi.org/10.1007/s10601-015-9183-0
Marques-Silva, J., Janota, M., Mencía, C.: Minimal sets on propositional formulae. problems and reductions. Artif. Intell. 252, 22–50 (2017)
Mencía, C., Marques-Silva, J.: Reasoning about strong inconsistency in ASP. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 332–342. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51825-7_24
Pajunen, J., Janhunen, T.: Solution enumeration by optimality in answer set programming. Theory Pract. Log. Program. 21(6), 750–767 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Alviano, M., Dodaro, C., Fiorentino, S., Previti, A., Ricca, F. (2022). Enumeration of Minimal Models and MUSes in WASP. In: Gottlob, G., Inclezan, D., Maratea, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2022. Lecture Notes in Computer Science(), vol 13416. Springer, Cham. https://doi.org/10.1007/978-3-031-15707-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-15707-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15706-6
Online ISBN: 978-3-031-15707-3
eBook Packages: Computer ScienceComputer Science (R0)