Abstract
Even for small logic programs, the number of resulting answer-sets can be tremendous. In such cases, users might be incapable of comprehending the space of answer-sets as a whole nor being able to identify a specific answer-set according to their needs. To overcome this difficulty, we propose a general formal framework that takes an arbitrary logic program as input, and allows for navigating the space of answer-sets in a systematic interactive way analogous to faceted browsing. The navigation is carried out stepwise, where each step narrows down the remaining solutions, eventually arriving at a single one. We formulate two navigation modes, one stringent conflict avoiding, and a “free” mode, where conflicting selections of facets might occur. For the latter mode, we provide efficient algorithms for resolving the conflicts. We provide an implementation of our approach and demonstrate that our framework is able to handle logic programs for which it is currently infeasible to retrieve all answer sets.
We would like to thank the anonymous reviewers for their valuable feedback. This work is partially supported by the German Research Foundation (DFG) within the Research Training Group QuantLA (GRK 1763) and within the Collaborative Research Center SFB 912 – HAEC.
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 subscriptionsReferences
Arenas, M., Bertossi, L.E., Chomicki, J.: Specifying and querying database repairs using logic programs with exceptions. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrozny, S. (eds.) FQAS 2000. Advances in Soft Computing, vol. 7, pp. 27–41. Physica, Heidelberg (2000). https://doi.org/10.1007/978-3-7908-1834-5_3
Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
Delgrande, J.P., Faber, W. (eds.): LPNMR 2011. LNCS (LNAI), vol. 6645. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20895-9
Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., et al. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40–110. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03754-2_2
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR system dlv: progress report, comparisons and benchmarks. In: Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), Trento, Italy, 2–5 June 1998, pp. 406–417. Morgan Kaufmann (1998)
Febbraro, O., Reale, K., Ricca, F.: ASPIDE: integrated development environment for answer set programming. In: Delgrande and Faber [3], pp. 317–330
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 6, pp. 1–238. Morgan and Claypool Publishers (2012)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report. CoRR abs/1405.3694 (2014)
Gebser, M., Kaminski, R., König, A., Schaub, T.: Advances in gringo series 3. In: Delgrande and Faber [3], pp. 345–351
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)
Gertz, M.: Diagnosis and repair of constraint violations in database systems. Datenbank Rundbrief 19, 96 (1997)
Kloimüllner, C., Oetsch, J., Pührer, J., Tompits, H.: Kara: a system for visualising and visual editing of interpretations for answer-set programs. In: Tompits, H., et al. (eds.) INAP/WLP -2011. LNCS (LNAI), vol. 7773, pp. 325–344. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41524-1_20
Lifschitz, V.: What is answer set programming? In: Fox, D., Gomes, C.P. (eds.) Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, 13–17 July 2008, pp. 1594–1597. AAAI Press (2008)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3–4), 241–273 (1999)
Oetsch, J., Pührer, J., Tompits, H.: Stepwise debugging of answer-set programs. TPLP 18(1), 30–80 (2018)
Preußer, T.B., Engelhardt, M.R.: Putting queens in carry chains, No27. Signal Process. Syst. 88(2), 185–201 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Alrabbaa, C., Rudolph, S., Schweizer, L. (2018). Faceted Answer-Set Navigation. In: Benzmüller, C., Ricca, F., Parent, X., Roman, D. (eds) Rules and Reasoning. RuleML+RR 2018. Lecture Notes in Computer Science(), vol 11092. Springer, Cham. https://doi.org/10.1007/978-3-319-99906-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-99906-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99905-0
Online ISBN: 978-3-319-99906-7
eBook Packages: Computer ScienceComputer Science (R0)