Abstract
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q∪ R have the same stable models for any other program R. This property strengthens equivalence of P and Q with respect to stable models (which is the particular case for R= ∅), and has an application in program optimization. In this paper, we consider the more liberal notion of uniform equivalence, in which R ranges only over the sets of facts rather than all sets of rules. This notion, which is well-known, is particularly useful for assessing whether programs P and Q are equivalent as components in a logic program which is modularly structured. We provide semantical characterizations of uniform equivalence for disjunctive logic programs and some restricted classes, and analyze the computational cost of uniform equivalence in the propositional (ground) case. Our results, which naturally extend to answer set semantics, complement the results on strong equivalence of logic programs and pave the way for optimizations in answer set solvers as a tool for input-based problem solving.
This work was partially supported by the Austrian Science Fund (FWF) Project Z29-N04, and the European Commission 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)
Ben-Eliyahu, R., Palopoli, L.: Reasoning with minimal models: Efficient algorithms and applications. In: Proc. KR 1994, pp. 39–50 (1994)
Cabalar, P.: A three-valued characterization for strong equivalence of logic programs. In: Proc. AAAI 2002, pp. 106–111 (2002)
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., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM TODS 22(3), 364–417 (1997)
Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. Tech. Rep. INFSYS RR-1843-03-08, Inst. für Informationssysteme, TU Wien (2003)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence (July 2003) (manuscript) (submitted)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Eliminating disjunction from propositional logic programs under stable model preservation (August 2003) (manuscript) (submitted)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming: Proc. Fifth Int’l Conference and Symposium, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. Tech. Rep. INFSYS RR-1843-02-14, Inst. für Informationssysteme, TU Wien (2002)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. on Computational Logic 2(4), 526–541 (2001)
Lifschitz, V., Turner, H.: Splitting a logic program. In: Proc. ICLP 1994, pp. 23–38 (1994)
Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proc. KR 2002, pp. 170–176 (2002)
Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proc. AAAI 2002, pp. 112–117 (2002)
Maher, M.J.: Equivalences of logic programs. In: Minker [17], pp. 627–658
Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Francisco (1988)
Niemelä, I., Simons, P., Syrjänen, T.: Smodels: A system for answer set programming. In: Proc. 8th Int’l Workshop on Non-Monotonic Reasoning, NMR 2000 (2000)
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. Joint Conf. Declarative Programming, APPIA-GULP-PRODE (2003)
Przymusinski, T.: Stable semantics for disjunctive programs. New Generation Computing 9, 401–424 (1991)
Sagiv, Y.: Optimizing datalog programs. In: Minker [17], pp. 659–698
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)
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. (2003). Uniform Equivalence of Logic Programs under the Stable Model Semantics. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive