Abstract
In answer set programming, ground programs are used as intermediate representations of logic programs for which answer sets are computed. It is typical that such programs contain many redundant rules—increasing the length of the program unnecessarily. In this article, we address redundancy of rules in answer set programs, and in particular, in program modules that are used as components of programs. To this end, we provide an exact semantical characterization of redundancy and present a translation-based method for detecting redundant rules. A prototype implementation, the modular optimizer (modopt), has been developed in the context of the smodels system. In the experimental part, we study the effects of modular optimization on lengths and run times of programs.
This research is affiliated with the project “Methods for Constructing and Solving Large Constraint Models” funded by the Academy of Finland (research grant #122399).
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
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of ECAI 2006, Riva del Garda, Italy, pp. 412–416. IOS Press, Amsterdam (2006)
Janhunen, T., Oikarinen, E.: Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming 7(6), 697–744 (2007)
Oikarinen, E., Janhunen, T.: A translation-based approach to the verification of modular equivalence. Journal of Logic and Computation (to appear, 2008); A preliminary version appears in Proceedings of ASP 2007, pp. 255–269 (2007)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, Seattle, Washington, USA, pp. 1070–1080. MIT Press, Cambridge (1988)
Liberatore, P.: Redundancy in logic III: Non-monotonic reasoning. Artificial Intelligence 172(11), 1317–1359 (2008)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 87–99. Springer, Heidelberg (2003)
Järvisalo, M., Oikarinen, E.: Extended ASP tableaux and rule redundancy in normal logic programs. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 134–148. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janhunen, T. (2008). Removing Redundancy from Answer Set Programs. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-89982-2_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89981-5
Online ISBN: 978-3-540-89982-2
eBook Packages: Computer ScienceComputer Science (R0)