Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-31T06:35:44.437Z Has data issue: false hasContentIssue false
  • English
  • Français

Strong Equivalence of Logic Programs with Counting

Published online by Cambridge University Press:  24 June 2022

VLADIMIR LIFSCHITZ Open the ORCID record for VLADIMIR LIFSCHITZ [Opens in a new window]
VLADIMIR LIFSCHITZ*
Affiliation:
University of Texas at Austin, USA (e-mail: lifschitzv@gmail.com)
Get access Rights & Permissions [Opens in a new window]

Abstract

In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. In some cases, strong equivalence of programs in the input language of the grounder gringo can be established by deriving rules of each program from rules of the other. The possibility of such proofs has been demonstrated for a subset of that language that includes comparisons, arithmetic operations, and simple choice rules, but not aggregates. This method is extended here to a class of programs in which some uses of the #count aggregate are allowed.

Keywords

aggregatesanswer set programmingstrong equivalence

Information

Type
Original Article
Information
Theory and Practice of Logic Programming , Volume 22 , Issue 4: 38th International Conference on Logic Programming Special Issue I , July 2022 , pp. 573 - 588
Check for updates
Copyright
© The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Faber, W., Pfeifer, G. and Leone, N. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175, 278–298.CrossRefGoogle Scholar
Fandinno, J., Nansen, Z. and Lierler, Y. 2022. Axiomatization of aggregates in answer set programming. In Proceedings of the AAAI Conference on Artificial Intelligence. To appear.CrossRefGoogle Scholar
Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V. and Schaub, T. 2015. Abstract Gringo. Theory and Practice of Logic Programming 15, 449–463.CrossRefGoogle Scholar
Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T. and Thiele, S. 2019. Potassco User Guide. URL: https://github.com/potassco/guide/releases/ Google Scholar
Gelfond, M. and Kahl, Y. 2014. Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press.CrossRefGoogle Scholar
Gelfond, M. and Zhang, Y. 2019. Vicious circle principle, aggregates, and formation of sets in ASP based languages. Artificial Intelligence 275, 28–77.CrossRefGoogle Scholar
Harrison, A., Lifschitz, V., Pearce, D. and Valverde, A. 2017. Infinitary equilibrium logic and strongly equivalent logic programs. Artificial Intelligence 246, 22–33.CrossRefGoogle Scholar
Lifschitz, V. 2019. Answer Set Programming. Springer.CrossRefGoogle Scholar
Lifschitz, V. 2021. Here and there with arithmetic. Theory and Practice of Logic Programming.CrossRefGoogle Scholar
Lifschitz, V., Lühne, P. and Schaub, T. 2019. Verifying strong equivalence of programs in the input language of gringo. In Proceedings of the 15th International Conference on Logic Programming and Non-monotonic Reasoning.CrossRefGoogle Scholar
Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541.CrossRefGoogle Scholar
Marek, V. and Truszczynski, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Springer Verlag, 375–398.CrossRefGoogle Scholar
Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241–273.CrossRefGoogle Scholar
Truszczynski, M. 2012. Connecting first-order ASP and the logic FO(ID) through reducts. In Correct Reasoning: Essays on Logic-Based AI in Honor of Vladimir Lifschitz, E. Erdem, J. Lee, Y. Lierler and D. Pearce, Eds. Springer, 543–559.CrossRefGoogle Scholar