Titlebook: Logic Programming and Nonmonotonic Reasoning; Fourth International Jürgen Dix,Ulrich Furbach,Anil Nerode Conference proceedings 1997 Spring

overhaul

针叶树

玉米

BOLUS

消音器

Affordable classes of normal logic programs,class containing programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing one constraint, previously linear complexity is increased to intractability.

chiropractor

Resolution for skeptical stable semantics,ome inferences, which depend on non-ground negative goals, can be drawn without resorting to negation-as-failure; as a consequence, many goals which flounder in the standard setting, have a successful skeptical derivation. The paper contains a preliminary study of some interesting derivation strategies.

Mirage

ARK

0302-9743 ts of invited presentations. The papers included report state-of-the-art research and development in the interdisciplinary area of logic programming and logical foundations of artificial intelligence.978-3-540-63255-9978-3-540-69249-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

Favorable

7楼

archenemy

7楼