Abstract
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages, however, the modular structure of programs is hard to realise, since the output of an entire program cannot in general be composed from the output of its component programs in a direct manner. In this paper, we consider these aspects for the stable-model semantics of disjunctive logic programs (DLPs). We define the notion of a DLP-function, where a well-defined input/output interface is provided, and establish a novel module theorem enabling a suitable compositional semantics for modules. The module theorem extends the well-known splitting-set theorem and allows also a generalisation of a shifting technique for splitting shared disjunctive rules among components.
This work was partially supported by the Academy of Finland under project #211025 (“Advanced Constraint Programming Techniques for Large Structured Problems”) and by the Austrian Science Foundation (FWF) under project P18019-N04 (“Formal Methods for Comparing and Optimizing Nonmonotonic Logic Programs”).
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
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Gaifman, H., Shapiro, E.: Fully Abstract Compositional Semantics for Logic Programs. In: Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL’89), pp. 134–142 (1989)
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)
Baral, C., Dzifcak, J., Takahashi, H.: Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 376–390. Springer, Heidelberg (2006)
Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP’94), pp. 23–37. MIT Press, Cambridge (1994)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)
Eiter, T., et al.: Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273–287. Springer, Heidelberg (2006)
Oikarinen, E., Janhunen, T.: Modular Equivalence for Normal Logic Programs. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI’06), pp. 412–416 (2006)
Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 413–451. Springer, Heidelberg (2002)
Janhunen, T.: Some (In)translatability Results for Normal Logic Programs and Propositional Theories. Journal of Applied Non-Classical Logics 16(1–2), 35–86 (2006)
Janhunen, T., Oikarinen, T.: Automated Verification of Weak Equivalence within the SMODELS System. Theory and Practice of Logic Programming, To appear (2006)
Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12(1–2), 53–87 (1994)
Lifschitz, V.: Computing Circumscription. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI’85), pp. 121–127. Morgan Kaufmann, San Francisco (1985)
Eiter, T., et al.: Simplifying Logic Programs under Uniform and Strong Equivalence. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 87–99. Springer, Heidelberg (2003)
Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer-Set Programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI’05), pp. 97–102. Professional Book Center (2005)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S. (2007). Modularity Aspects of Disjunctive Stable Models. 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_16
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)