Abstract
We consider the simplification of logic programs under the stable-model semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been considered for nonmonotonic logic programs (the latter dates back to the 1980s, though) and provide semantic foundations for optimizing programs with input. Extending previous work, we investigate syntactic and semantic rules for program transformation, based on proper notions of consequence. We furthermore provide encodings of these notions in answer-set programming, and give characterizations of programs which are semantically equivalent to positive and Horn programs, respectively. Finally, we investigate the complexity of program simplification and determining semantical equivalence, showing that the problems range between coNP and \(\Pi_2^p\) complexity, and we present some tractable cases.
This work was partially supported by the Austrian Science Fund (FWF) under project Z29-N04, and the European Commission under projects FET-2001-37004 WASP and IST-2001-33570 INFOMIX.
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
Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12, 53–87 (1994)
Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 40(1), 1–46 (1999)
de Jongh, D.J., Hendriks, L.: Characterizations of Strongly Equivalent Logic Programs in Intermediate Logics. Theory and Practice of Logic Programming 3(3), 259–270 (2003)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79–103. Kluwer, Dordrecht (2000)
Eiter, T., Fink, M.: Uniform Equivalence of Logic Programs under the Stable Model Semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224–238. Springer, Heidelberg (2003) (to appear)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. In: Proc. ASP 2003 (2003), Available at http://CEURWS.org/Vol-78/
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22, 364–418 (1997)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
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)
Janhunen, T., Oikarinen, E.: LPEQ and DLPEQ – Translators for Automated Equivalence Testing of Logic Programs. In: Proc. LPNMR 2003 (2003) (to appear)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)
Lin, F.: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In: Proc. KR 2002, pp. 170–176. Morgan Kaufmann, San Francisco (2002)
Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proc. AAAI 2002, pp. 112–117. AAAI Press / MIT Press (2002)
Maher, M.J.: Equivalences of Logic Programs. In: Minker [15], pp. 627–658
Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, Washington DC (1988)
Osorio, M., Navarro, J., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 57–75. Springer, Heidelberg (2002)
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)
Pearce, D., Valverde, A.: Some Types of Equivalence for Logic Programs and Equilibrium Logic. In: Proc. APPIA-GULP-PRODE 2003 (2003)
Przymusinski, T.: Stable Semantics for Disjunctive Programs. New Generation Computing 9, 401–424 (1991)
Sagiv, Y.: Optimizing Datalog Programs. In: Minker [15], pp. 659–698
Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138, 181–234 (2002)
Turner, H.: Strong Equivalence for Logic Programs and Default Theories (Made Easy). In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 81–92. Springer, Heidelberg (2001)
Turner, H.: Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming 3(4-5), 609–622 (2003)
Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic (2003) (to appear), Available at http://arxiv.org/abs/cs.AI/0301010
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Fink, M., Tompits, H., Woltran, S. (2003). Simplifying Logic Programs Under Uniform and Strong Equivalence. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive