Order-consistent programs are cautiously monotonic
| dc.creator | Turner, Hudson | |
| dc.date | 2000-11-27 | |
| dc.date.accessioned | 2026-07-07T03:16:46Z | |
| dc.date.available | 2026-07-07T03:16:46Z | |
| dc.description | Some normal logic programs under the answer set (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 with some of its consequences does not alter its consequences. In fact, as we show, its answer sets remain unchanged. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0011042 | |
| dc.identifier | http://arxiv.org/abs/cs/0011042 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30479 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1;I.2.3 | |
| dc.title | Order-consistent programs are cautiously monotonic | |
| dc.type | text |