Hostname: page-component-745bb68f8f-v2bm5 Total loading time: 0 Render date: 2025-02-06T22:13:46.232Z Has data issue: false hasContentIssue false

Order-consistent programs are cautiously monotonic

Published online by Cambridge University Press:  25 June 2001

HUDSON TURNER
Affiliation:
Computer Science Department, University of Minnesota, Duluth, MN, USA; e-mail: hudson@d.umn.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Technical note
Copyright
© 2001 Cambridge University Press