Abstract
The causal rejection-based update semantics assign meanings to a Dynamic Logic Program (DLP), which is a sequence of logic programs each one updating the preceding ones. Although there are translations of DLPs under these update semantics to logic programs of Answer Set Programming (ASP), they have not led to efficient and easy to use implementations. This is mainly because such translations aim offline solving in a sense that the resulting logic program is given to an answer set solver to compute models of the current DLP and for any future updates the whole process has to be repeated from scratch. We aim to remedy this situation by utilizing multi-shot ASP, composed of iterative answer set computations of a changing program without restarting from scratch at every step. To this end, we developed a system called moviola, utilizing the multi-shot answer set solver clingo. Using the system, a user can interactively write a DLP, update it, compute its models according to various semantics on the fly.
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
Similar content being viewed by others
Notes
- 1.
- 2.
In this work, we assume that strong negation of atoms do not appear in logic programs of a DLP (refer to [9] for expansion of a DLP to make rule conflicts uniform).
- 3.
Here, we explain the encoding for only \(\mathsf {RD}\) semantics due to space constraints.
References
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, New York (2003)
De Cat, B., Denecker, M., Stuckey, P., Bruynooghe, M.: Lazy model expansion: interleaving grounding with search. J. Artif. Intell. Res. 52, 235–286 (2015)
Gebser, M., Janhunen, T., Jost, H., Kaminski, R., Schaub, T.: ASP solving for expanding universes. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 354–367. Springer, Cham (2015). doi:10.1007/978-3-319-23264-5_30
Janhunen, T.: On the effect of default negation on the expressiveness of disjunctive rules. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 93–106. Springer, Heidelberg (2001). doi:10.1007/3-540-45402-0_7
Leite, J.A., Pereira, L.M.: Generalizing updates: from models to programs. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds.) LPKR 1997. LNCS, vol. 1471, pp. 224–246. Springer, Heidelberg (1998). doi:10.1007/BFb0054796
Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theor. Pract. Logic Program. 2(6), 711–767 (2002)
Alferes, J.J., Leite, J., Pereira, L., Przymusinska, H., Przymusinski, T.: Dynamic updates of non-monotonic knowledge bases. J. Logic Program. 45(1–3), 43–70 (2000)
Alferes, J.J., Banti, F., Brogi, A., Leite, J.A.: The refined extension principle for semantics of dynamic logic programming. Stud. Logica 79(1), 7–32 (2005)
Slota, M., Leite, J.: On condensing a sequence of updates in answer-set programming. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (2013)
Banti, F., Alferes, J.J., Brogi, A.: Operational semantics for DyLPs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS, vol. 3808, pp. 43–54. Springer, Heidelberg (2005). doi:10.1007/11595014_5
Gebser, M., Kaminski, R., Schaub, T.: Complex optimization in answer set programming. Theor. Pract. Logic Program. 11(4–5), 821–839 (2011)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: preliminary report. In: Technical Communication of the 30th International Conference on Logic Programming (2014)
Oikarinen, E.: Modular answer set programming. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 462–463. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74610-2_46
Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T.: Answer set programming modulo acyclicity. Fund. Inform. 147(1), 63–91 (2016)
Acknowledgments
This work was partially supported by FCT under strategic project UID/CEC/04516/2013.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sabuncu, O., Leite, J. (2017). moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming. In: Balduccini, M., Janhunen, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2017. Lecture Notes in Computer Science(), vol 10377. Springer, Cham. https://doi.org/10.1007/978-3-319-61660-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-61660-5_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61659-9
Online ISBN: 978-3-319-61660-5
eBook Packages: Computer ScienceComputer Science (R0)