Abstract
In answer set programming (ASP) a problem is solved declaratively by writing down a logic program the answer sets of which correspond to the solutions of the problem, and computing the answer sets of the program using a special purpose search engine.The growing interest towards ASP is mostly due to efficient search engines, such as smodels and dlv. Consequently, a variety of interesting applications of ASP has emerged, e.g., in planning, product configuration, and computer aided verification.Despite the declarative nature of ASP the development of programs resembles that of programs in conventional programming, i.e., a programmer often develops a series of programs for a particular problem, e.g., when optimizing execution time and space.This gives rise to a meta-level problem of verifying whether subsequent programs are equivalent. To solve the equivalence verification problem a translation-based approach has been proposed and extended further [1,2,3] . The idea is to combine logic programs P and Q into logic programs EQT(P,Q) and EQT(Q,P) which have no answer sets iff P and Q are equivalent, which allows the use of the same ASP solver for the equivalence verification task as for the search of answer sets. The translation-based method treats programs as integral entities which limits its usefulness, e.g., if a small local change is made in a large program. The same line of thinking applies to current ASP methodology in general. ASP programs are typically seen as integral entities, and there is a lack of mechanisms available in modern programming languages that ease program development by allowing re-use of code or breaking programs into smaller pieces.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Janhunen, T., Oikarinen, E.: Testing the equivalence of logic programs under stable model semantics. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 493–504. Springer, Heidelberg (2002)
Oikarinen, E., Janhunen, T.: Verifying the equivalence of logic programs in the disjunctive case. In: Lifschitz, V., Niemelä, I. (eds.) Logic Programming and Nonmonotonic Reasoning. LNCS (LNAI), vol. 2923, pp. 180–193. Springer, Heidelberg (2003)
Janhunen, T., Oikarinen, E.: Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming (to appear)
Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of Logic Programming 19/20, 443–502 (1994)
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)
Tari, L., Baral, C., Anwar, S.: A language for modular answer set programming: Application to ACC tournament scheduling. In: ASP 2005, CEUR-WS.org (2005)
Oikarinen, E.: Modular answer set programming. Research Report A106, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2006)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI 2006, pp. 412–416. IOS Press, Amsterdam (2006)
Oikarinen, E.: Modularity in smodels programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007, vol. 4483, pp. 321–326. Springer, Heidelberg (2007)
Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007, vol. 4483, pp. 175–187. Springer, Heidelberg (2007)
Gaifman, H., Shapiro, E.Y.: Fully abstract compositional semantics for logic programs. In: POPL 1989, pp. 134–142. ACM Press, New York (1989)
Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 134–146. Springer, Heidelberg (2004)
Oikarinen, E., Janhunen, T.: A linear transformation from prioritized circumscription to disjunctive logic programming. In: ICLP 2007 (to appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oikarinen, E. (2007). Modular Answer Set Programming. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)