On Equivalence of Infinitary Formulas under the Stable Model Semantics
arXiv:1403.6689 · doi:10.1017/S1471068414000088
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. To appear in Theory and Practice of Logic Programming (TPLP).