Titlebook: Logic Programming and Nonmonotonic Reasoning; 5th International Co Michael Gelfond,Nicola Leone,Gerald Pfeifer Conference proceedings 1999

溫和女孩

GRAVE

animated

Locally Determined Logic Programserode, and Remmel [.] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program has a stable model which is re

燈泡

Annotated Revision ProgramsFitting who assigned annotations to revision atoms. Annotations provide a way to quantify certainty (likelihood) that a revision atom holds. The main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition and to propo

LAST

不自然

An Argumentation Framework for Reasoning about Actions and Changeinto the argumentation framework of Logic Programming without Negation as Failure (LPwNF). This translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of l

GLIB

Representing Transition Systems by Logic Programsheories and with action language ..We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. The translations from . into logic programming that we investigate serve as a basis for the u

縮影

引導(dǎo)

From Causal Theories to Logic Programs (Sometimes)assical negation [.]. We found this translation interesting for at least the following two reasons: it provides a basis on which a wide class of causal theories in ([.]) can be computed; and it sheds some new lights on the nature of the causal theories in [.]. Our translation is in many ways similar

scrutiny

Monotone Expansion of Updates in Logical Databasesation is proven to be a Σ..-complete problem. We define a class of operators expanding the input updates correctly with respect to the IC. The particular monotone expansion operator we describe is incrementally computed in square time. It provides a practical optimization of the standard complete ch