Abstract
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. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Harrison, A., Lifschitz, V., & Truszczynski, M. (2013). On equivalent transformations of infinitary formulas under the stable model semantics (Preliminary report). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8148 LNAI, pp. 387–394). https://doi.org/10.1007/978-3-642-40564-8_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
