Order-consistent programs are cautiously monotonic
2001 ◽
Vol 1
(4)
◽
pp. 487-495
◽
Some normal logic programs under the answer set (or stable model) semantics lack the appealing property of ‘cautious monotonicity.’ That is, augmenting a program with one of its consequences may cause it to lose another of its consequences. The syntactic condition of ‘order-consistency’ was shown by Fages to guarantee existence of an answer set. This note establishes that order-consistent programs are not only consistent, but cautiously monotonic. From this it follows that they are also ‘cumulative’. That is, augmenting an order-consistent program with some of its consequences does not alter its consequences. In fact, as we show, its answer sets remain unchanged.
2019 ◽
Vol 19
(5-6)
◽
pp. 891-907
2007 ◽
Vol 29
◽
pp. 353-389
◽
2020 ◽
Vol 34
(03)
◽
pp. 3017-3024
Keyword(s):
2018 ◽
Vol 19
(2)
◽
pp. 262-289
◽
2010 ◽
Vol 10
(4-6)
◽
pp. 481-496
◽
Keyword(s):
2011 ◽
Vol 13
(1)
◽
pp. 107-142
◽
Keyword(s):
2006 ◽
Vol 6
(1-2)
◽
pp. 61-106
◽
Keyword(s):
2014 ◽
Vol 50
◽
pp. 31-70
◽
2019 ◽
Vol 19
(04)
◽
pp. 603-628
◽