Abstract
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major approach is Oikarinnen and Janhunen’s Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Their module theorem properly strengthens Lifschitz and Turner’s splitting set theorem for normal logic programs. However, this approach is limited by module conditions that are imposed in order to ensure the compatibility of their module system with the stable model semantics, namely forcing output signatures of composing modules to be disjoint and disallowing positive cyclic dependencies between different modules. These conditions turn out to be too restrictive in practice and after recently discussing alternative ways of lifting the first restriction [17], we now show how one can allow positive cyclic dependencies between modules, thus widening the applicability of this framework and the scope of the module theorem.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Babb, J., Lee, J.: Module theorem for the general theory of stable models. TPLP 12(4–5), 719–735 (2012)
Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press (2003)
Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. J. Log. Program. 19(20), 443–502 (1994)
Viegas Damásio, C., Moura, J.: Modularity of P-log programs. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 13–25. Springer, Heidelberg (2011)
Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Modular nonmonotonic logic programming revisited. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 145–159. Springer, Heidelberg (2009)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred and weakly preferred answer sets bymeta-interpretation in answer set programming. In: Proceedings AAAI 2001 Spring Symposium on Answer Set Programming, pp. 45–52. AAAI Press (2001)
Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. TPLP 5(1–2), 45–74 (2005)
Gaifman, H., Shapiro, E.: Fully abstract compositional semantics for logic programs. In: Symposium on Principles of Programming Languages, POPL, pp. 134–142. ACM, New York (1989)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Program. MIT Press (1988)
Giordano, L., Martelli, A.: Structuring logic programs: a modal approach. The Journal of Logic Programming 21(2), 59–94 (1994)
Järvisalo, M., Oikarinen, E., Janhunen, T., Niemelä, I.: A module-based framework for multi-language constraint modeling. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 155–168. Springer, Heidelberg (2009)
Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1–2), 39–54 (2002)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 2001 (2000)
Mancarella, P., Pedreschi, D.: An algebra of logic programs. In: ICLP/SLP, pp. 1006–1023 (1988)
Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective (1999)
Miller, D.: A theory of modules for logic programming. In. In Symp. Logic Programming, pp. 106–114 (1986)
Moura, J., Damásio, C.V.: Generalising modular logic programs. In: 15th International Workshop on Non-Monotonic Reasoning (NMR 2014) (2014)
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 72–79 (1998)
Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. Theory Pract. Log. Program. 8(5–6), 717–761 (2008)
O’Keefe, R.A.: Towards an algebra for constructing logic programs. In: SLP, pp. 152–160 (1985)
Slota, M., Leite, J.: Robust equivalence models for semantic updates of answer-set programs. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proc. of KR 2012. AAAI Press (2012)
Tasharrofi, S., Ternovska, E.: A semantic account for modularity in multi-language modelling of search problems. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCoS 2011. LNCS, vol. 6989, pp. 259–274. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Moura, J., Damásio, C.V. (2015). Allowing Cyclic Dependencies in Modular Logic Programming. In: Pereira, F., Machado, P., Costa, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 2015. Lecture Notes in Computer Science(), vol 9273. Springer, Cham. https://doi.org/10.1007/978-3-319-23485-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-23485-4_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23484-7
Online ISBN: 978-3-319-23485-4
eBook Packages: Computer ScienceComputer Science (R0)