2,154 research outputs found
On Equivalence of Infinitary Formulas under the Stable Model Semantics
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)
- …