TY - GEN
T1 - On equivalent transformations of infinitary formulas under the stable model semantics (Preliminary report)
AU - Harrison, Amelia
AU - Lifschitz, Vladimir
AU - Truszczynski, Miroslaw
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84885692564
UR - https://www.scopus.com/pages/publications/84885692564#tab=citedBy
U2 - 10.1007/978-3-642-40564-8_38
DO - 10.1007/978-3-642-40564-8_38
M3 - Conference contribution
AN - SCOPUS:84885692564
SN - 9783642405631
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 387
EP - 394
BT - Logic Programming and Nonmonotonic Reasoning - 12th International Conference, LPNMR 2013, Proceedings
T2 - 12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013
Y2 - 15 September 2013 through 19 September 2013
ER -