Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-25T04:42:12.068Z Has data issue: false hasContentIssue false
  • English
  • Français

Order-consistent programs are cautiously monotonic

Published online by Cambridge University Press:  25 June 2001

HUDSON TURNER
HUDSON TURNER
Affiliation:
Computer Science Department, University of Minnesota, Duluth, MN, USA; e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

answer setsstable modelssemantic properties
Type
Technical note
Information
Theory and Practice of Logic Programming , Volume 1 , Issue 4 , July 2001 , pp. 487 - 495
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)