On equivalence of infinitary formulas under the stable model semantics
2014 ◽
Vol 15
(1)
◽
pp. 18-34
◽
Keyword(s):
AbstractPropositional 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.
2019 ◽
Vol 19
(5-6)
◽
pp. 1006-1020
◽
Keyword(s):
2020 ◽
Vol 34
(03)
◽
pp. 3017-3024
Keyword(s):
2015 ◽
Vol 30
(4)
◽
pp. 899-922
◽
Keyword(s):
2010 ◽
Vol 10
(4-6)
◽
pp. 481-496
◽
Keyword(s):
2014 ◽
Vol 50
◽
pp. 31-70
◽
2004 ◽
Vol 4
(3)
◽
pp. 325-354
◽
Keyword(s):
2016 ◽
Vol 17
(2)
◽
pp. 226-243
◽
Keyword(s):
2012 ◽
Vol 12
(4-5)
◽
pp. 719-735
◽
Keyword(s):