Abstract
Answer Set Programming has become an increasingly popular formalism for declarative problem solving. Among the huge body of theoretical results, investigations of different equivalence notions between logic programs play a fundamental role for understanding modularity and optimization. While strong equivalence between two programs holds if they can be faithfully replaced by each other in any context (facts and rules), uniform equivalence amounts to equivalent behavior of programs under any set of facts. Both notions (as well as several variants thereof) have been extensively studied. However, the somewhat reverse notion of equivalence which holds if two programs are equivalent under the addition of any set of proper rules (i.e., all rules except facts) has not been investigated yet. In this paper, we close this gap and give a thorough study of this notion, which we call rule equivalence , and its parameterized version where we allow facts over a given restricted alphabet to appear in the context. This notion of equivalence is thus a relationship between two programs whose input is (partially) fixed but where additional proper rules might still be added. Such a notion might be helpful in debugging of programs. We give full characterization results and a complexity analysis for the propositional case of rule equivalence and its relativized versions. Moreover, we address the problem of program simplification under rule equivalence. Finally, we show that rule equivalence is decidable in the non-ground case.
Article PDF
Similar content being viewed by others
References
Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526–541 (2001)
Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory Pract. Logic Program. 3(4-5), 602–622 (2003)
Sagiv, Y.: Optimizing datalog programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659–698. Morgan Kaufmann, Burlington (1988)
Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) Proceedings of the 19th International Conference on Logic Programming (ICLP’03). number 2916 in LNCS, pp. 224–238. Springer, Berlin (2003)
Fink, M.: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there. Theory Pract. Logic Program. 11(2–3), 171–202 (2011)
Inoue, K., Sakama, C.: Equivalence of logic programs under upyears. In: Alferes, J.J., Leite, J.A. (eds.) Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA’04, vol. 3229 of LNCS, pp. 174–186. Springer, Berlin (2004)
Woltran, S.: Characterizations for relativized notions of equivalence in answer set programming. In: Alferes, J.J., Leite, J.A. (eds.) Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA’04, vol. 3229 of LNCS, pp. 161–173. Springer (2004)
Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Log 8(3), 17:1–17:53 (2007)
Woltran, S.: A common view on strong, uniform, and other notions of equivalence in answer-set programming. TPLP 8(2), 217–234 (2008)
Truszczynski, M., Woltran, S.: Relativized hyperequivalence of logic programs for modular programming. TPLP 9(6), 781–819 (2009)
Pearce, D., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. In: Lifschitz, V., Niemelä, I. (eds.) Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’04). vol. 2923 of LNCS, pp. 194–206. Springer, Berlin (2004)
Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. (JAIR) 35, 813–857 (2009)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 412–416. IOS Press, Amsterdam (2006)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemelä, I. (eds.) Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7). vol. 2923 of LNCS, pp. 87–99. Springer, Berlin (2004)
Eiter, T., Fink, M., Pu̇hrer, J., Tompits, H., Woltran, S.: Model-based recasting in answer-set programming. J. Appl. Non-Classical Logics 23(1–2), 75–104 (2013)
Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and uniform equivalence in answer-set programming: characterizations and complexity results for the non-ground case. In: Proceedings of the 20th national conference on artificial intelligence (AAAI’05), pp. 695–700. AAAI Press (2005)
Bliem, B., Woltran, S.: Equivalence between answer-set programs under (partially) fixed input. In: Gyssens, M., Simari, G.R. (eds.) Proceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems (FoIKS’16). vol. 9616 of LNCS, pp. 95–111. Springer, Berlin (2016)
Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25(3–4), 369–389 (1999)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499–562 (2006)
Acknowledgments
Open access funding provided by Austrian Science Fund (FWF). This work was supported by the Austrian Science Fund (FWF) projects P25607 and Y698.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Bliem, B., Woltran, S. Equivalence between answer-set programs under (partially) fixed input. Ann Math Artif Intell 83, 277–295 (2018). https://doi.org/10.1007/s10472-017-9567-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-017-9567-5