Titlebook: Logic Programming and Knowledge Representation; Third International Jürgen Dix,Luís Moniz Pereira,Teodor C. Przymusins Conference proceedi

Definitive

Partial evidential stable models for disjunctive deductive databases,t there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics..We define a consistent variant of each class of models, which we call . and .. It is shown that if a database is already consistent w.r.

Dignant

Disjunctive logic programming and autoepistemic logic,served that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stabl

套索

A system for abductive learning of logic programs,heory. A new type of induction problem has been defined as an extension of the Inductive Logic Programming framework. In the new problem definition, both the background and the target theories are abductive logic programs and abductive derivability is used as the coverage relation..LAP is based on t

lethargy

Refining action theories through abductive logic programming,ometimes not simple to give an immediately available action theory. In this paper we will present an abductive methodology for describing action domains. We start with an action theory which is not complete, i.e., has more than one model. Then, after some tests are done, we can abduce a complete act

Exposition

FORGO

有組織

Generalizing updates: From models to programs,ion programs. The updating of theory models is governed by their update rules and also by inertia applied to those literals not directly affected by the update program. Though this is important, it remains necessary to tackle as well the updating of programs specifying theories. Some results have be

不再流行

持久

meditation