It has been known for a long time that intuitionistically equivalent formulas 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.

PDF

In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) 2013.

@inproceedings{harrison:lpnmr13ea, title={On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics (Preliminary Report)}, author={Amelia Harrison and Vladimir Lifschitz and Miroslaw Truszczynski}, booktitle={Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)}, url="http://www.cs.utexas.edu/users/ai-lab?harrison:lpnmr13ea", year={2013} }