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

charity

书目名称Logic Programming and Nonmonotonic Reasoning影响因子(影响力)




书目名称Logic Programming and Nonmonotonic Reasoning影响因子(影响力)学科排名




书目名称Logic Programming and Nonmonotonic Reasoning网络公开度




书目名称Logic Programming and Nonmonotonic Reasoning网络公开度学科排名




书目名称Logic Programming and Nonmonotonic Reasoning被引频次




书目名称Logic Programming and Nonmonotonic Reasoning被引频次学科排名




书目名称Logic Programming and Nonmonotonic Reasoning年度引用




书目名称Logic Programming and Nonmonotonic Reasoning年度引用学科排名




书目名称Logic Programming and Nonmonotonic Reasoning读者反馈




书目名称Logic Programming and Nonmonotonic Reasoning读者反馈学科排名

亲属

Belief, Knowledge, Revisions, and a Semantics of Non-Monotonic Reasoningerefore they enable to define a semantics of insertions to and revisions of AELKB-theories. A computation of the transformations (between possible worlds) is based on (an enhanced) model-checking. The transformations may be used as a method of computing static autoepistemic expansions.

PRISE

From Causal Theories to Logic Programs (Sometimes) to the one given in [.,.]. Our main result is a theorem that shows how action precondition and fully instantiated successor state axioms can be computed from the answer sets of the translated logic program.

粗糙滥制

Pushing Goal Derivation in DLP Computationsg and diagnosis, or implicitly in the form of integrity constraints). This way, a lot of useless models are discarded “a priori” and the computation converges rapidly toward the generation of the “right” answer set. A few preliminary benchmarks show dramatic efficiency gains due to the new techniques.

labile

Abrupt

On the Role of Negation in Choice Logic Programsa program. Based on an intuitive notion of unfounded set for choice programs, we show that several results from (seminegative) disjunctive programs can be strengthened; characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.

改进

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoningt circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.

MIRTH

Annotated Revision Programsn of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the case of annotated revision programs.

Decrepit

Linear Tabulated Resolution for the Well-Founded Semanticsemantics, which resolves the problems of infinite loops and redundant computations while preserving the linearity. For non-floundering queries, the proposed method is sound and complete for general logic programs with the bounded-term-size property.

affect