Abstract
A recently proposed module system for answer set programming is generalized for the input language of the smodels system. To show that the stable model semantics is compositional and modular equivalence is a congruence for composition of smodels program modules, a general translation-based scheme for introducing syntactic extensions of the module system is presented. A characterization of the compositionality of the semantics is used as an alternative condition for module composition, which allows compositions of modules even in certain cases with positive recursion between the modules to be composed.
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
Preview
Unable to display preview. Download preview PDF.
References
Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3-4), 241–273 (1999)
Eiter, T., Gottlob, G., Veith, H.: Modular logic programming and generalized quantifiers. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 290–309. Springer, Heidelberg (1997)
Ianni, G., et al.: Enhancing answer set programming with templates. In: NMR, pp. 233–239 (2004)
Tari, L., Baral, C., Anwar, S.: A language for modular answer set programming: Application to ACC tournament scheduling. In: ASP, CEUR-WS.org, 277–292 (2005)
Lifschitz, V., Turner, H.: Splitting a logic program. In: ICLP, pp. 23–37. MIT Press, Cambridge (1994)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM TODS 22(3), 364–418 (1997)
Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 306–320. Springer, Heidelberg (2004)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI, pp. 412–416. IOS Press, Amsterdam (2006)
Gaifman, H., Shapiro, E.Y.: Fully abstract compositional semantics for logic programs. In: POPL, pp. 134–142. ACM Press, New York (1989)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM TOCL 2(4), 526–541 (2001)
Janhunen, T.: Some (In)translatability Results for Normal Logic Programs and Propositional Theories. JANCL 16(1-2), 35–86 (2006)
Marek, V.W., Truszczyński, M.: Autoepistemic logic. J. ACM 38(3), 588–619 (1991)
Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol. 2258, pp. 306–320. Springer, Heidelberg (2001)
Janhunen, T., Oikarinen, E.: Automated verification of weak equivalence within the smodels system. TPLP 7(4), 1–48 (2007)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comp. 1(2), 146–160 (1972)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Oikarinen, E. (2007). Modularity in smodels Programs. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)