Emergent Mind
On Equivalence of Infinitary Formulas under the Stable Model Semantics
(1403.6689)
Published Mar 26, 2014
in
cs.LO
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).
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.