{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:49Z","timestamp":1761620809759},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2001,6,25]],"date-time":"2001-06-25T00:00:00Z","timestamp":993427200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2001,7]]},"abstract":"<jats:p>Some normal logic programs under the answer set (or stable model) semantics lack the \nappealing property of \u2018cautious monotonicity.\u2019 That is, augmenting a program with one of \nits consequences may cause it to lose another of its consequences. The syntactic condition of \n\u2018order-consistency\u2019 was shown by Fages to guarantee existence of an answer set. This note \nestablishes that order-consistent programs are not only consistent, but cautiously monotonic. \nFrom this it follows that they are also \u2018cumulative\u2019. That is, augmenting an order-consistent \nprogram with some of its consequences does not alter its consequences. In fact, as we show, \nits answer sets remain unchanged.<\/jats:p>","DOI":"10.1017\/s1471068401001144","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:16:36Z","timestamp":1027775796000},"page":"487-495","source":"Crossref","is-referenced-by-count":2,"title":["Order-consistent programs are cautiously monotonic"],"prefix":"10.1017","volume":"1","author":[{"given":"HUDSON","family":"TURNER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2001,6,25]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068401001144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T19:25:49Z","timestamp":1554060349000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068401001144\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6,25]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S1471068401001144"],"URL":"https:\/\/doi.org\/10.1017\/s1471068401001144","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,6,25]]}}}