论文信息 - Every Normal Program has a Nearly-Stable Model

Every Normal Program has a Nearly-Stable Model

We discuss a revision method for normal logic programs that do not have a stable model. The method we propose is a revision-by-transformation method: we apply some rule transformations which do not affect the meaning of such a program as a first-order theory, but ensure that the transformed program has at least one stable model.

Cees Witteveen | C. Witteveen

[1] V. Wiktor Marek,et al. Nonmonotonic Logic , 1993, Artificial Intelligence.

[2] Laura Giordano,et al. Generalized Stable Models, Truth Maintenance and Conflict Resolution , 1990, ICLP.

[3] Marco Schaerf. Negation and minimality in non-horn databases , 1993, PODS '93.

[4] Cees Witteveen,et al. Skeptical reason belief revision maintenance and , 2002 .

[5] Jon Doyle,et al. A Truth Maintenance System , 1979, Artif. Intell..

[6] Georg Gottlob,et al. Removing Redundancy from a Clause , 1993, Artif. Intell..

[7] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[8] Jürgen Dix,et al. Causal Models of Disjunctive Logic Programs , 1994, ICLP.