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

CHURL

Updating Extended Logic Programs through Abductionre considered. We formulate these updates through abduction, and provide methods for computing them with .. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the . sets of an update program. The proposed technique provides a

增減字母法

LUPS — A Language for Updating Logic Programswith time. To overcome this limitation, in a recent paper, the authors introduced the concept of .. There, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs), P. ⊕...⊕P.. Each such program contains knowledge about some given

figment

Multiple

Linear Tabulated Resolution for the Well-Founded Semanticsrams. Global SLS-resolution is linear but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The distinctive advantage of a linear approach is that it can be implemented usi

濕潤

A Case Study in Using Preference Logic Grammars for Knowledge Representationings and truncations, extraction of data via parsing, and correcting inconsistencies in extracted data. Prolog programming offers natural advantages for standardizing: definite clause grammars can be used to parse data; Prolog rules can be used to correct inconsistencies; and Prolog’s simple syntax

Maximizer

Minimal Founded Semantics for Disjunctive Logic Programmings stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, the minimal founded semantics seems to be, in some case, more

uveitis

Externalize

Default Reasoning via Blocking Setsccomplish this by shifting the emphasis from the application of individual default rules to that of the . application of a default rule together with rules supporting this application. This allows for reasoning in an incremental yet compositional fashion, without giving up the expressiveness needed

Immortal

Coherent Well-founded Annotated Logic Programsve representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programsin order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpret

DEFER