Skip to main content Accessibility help
×
Home

On equivalence of infinitary formulas under the stable model semantics

  • AMELIA HARRISON (a1), VLADIMIR LIFSCHITZ (a1) and MIROSLAW TRUSZCZYNSKI (a2)

Abstract

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.

Copyright

References

Hide All
Ferraris, P. 2005. Answer sets for propositional theories. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Springer, Berlin, Heidelberg, 119131.
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of International Logic Programming Conference and Symposium, Kowalski, R. and Bowen, K., Eds. MIT Press, Cambridge, MA, 10701080.
Harrison, A. 2013. On the semantics of Gringo and proving strong equivalence. In Theory and Practice of Logic Programming (Online Supplement). URL: http://journals.cambridge.org/downloadsup.php?file=/tlp2013035.pdf.
Harrison, A., Lifschitz, V. and Truszczynski, M. 2013. On equivalent transformations of infinitary formulas under the stable model semantics (preliminary report). In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Springer, Berlin, Heidelberg, 387394.
Hosoi, T. 1966. The axiomatization of the intermediate propositional systems Sn of Gödel. Journal of the Faculty of Science of the University of Tokyo 13, 183187.
Kalmár, L. 1935. Über die Axiomatisierbarkeit des Aussagenkalküls. Acta Scientiarum Mathematicarum 7, 222243.
Karp, C. R. 1964. Languages with Expressions of Infinite Length. North-Holland, Amsterdam, the Netherlands.
Lifschitz, V., Morgenstern, L. and Plaisted, D. 2008. Knowledge representation and classical logic. In Handbook of Knowledge Representation, van Harmelen, F., Lifschitz, V. and Porter, B., Eds. Elsevier, Philadelphia, PA, 388.
Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526541.
Lifschitz, V. and Yang, F. 2012. Lloyd-Topor completion and general stable models. In Working Notes of the 5th Workshop of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012).
Pearce, D. 1997. A new logical characterization of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence, 1216), Dix, J., Pereira, L. and Przymusinski, T., Eds. Springer, Berlin, Germany, 5770.
Scott, D. and Tarski, A. 1958. The sentential calculus with infinitely long expressions. Colloquium Mathematicae 6, 165170.
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, Springer Berlin, Heidelberg, 543559.

Keywords

On equivalence of infinitary formulas under the stable model semantics

  • AMELIA HARRISON (a1), VLADIMIR LIFSCHITZ (a1) and MIROSLAW TRUSZCZYNSKI (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed