Signed data dependencies in logic programs
Journal of Logic Programming
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Completed logic programs and their consistency
Journal of Logic Programming
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Theoretical foundations for non-monotonic reasoning in expert systems
Logics and models of concurrent systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
On the relations between stable and well-founded semantics of logic programs
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Proceedings of the eleventh international conference on Logic programming
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
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.