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

逃避現(xiàn)實(shí)

稱贊

Aromatic

Cumulus

LATE

Is non-monotonic reasoning always harder, actually simplifies matters. Indeed, one of the reasons for considering non-monotonic systems is the hope of speeding up reasoning, and not to slow it down. In this paper, we consider proof lengths in a cut-free sequent calculus, and we show that the application of circumscription (or completion) t

陰險(xiǎn)

生命層

Affordable classes of normal logic programs,ms. These classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related 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-comp

carotid-bruit

障礙物

Separating disbeliefs from beliefs in autoepistemic reasoning, disbelief. Along the separation of beliefs and disbeliefs, the relationship between autoepistemic logic and default logic becomes very intuitive. Straightforward ways of translating default theories into separated autoepistemic theories and back are presented. These translations are shown to preser

CAPE

Power defaults (preliminary report), the law of reasoning by cases. This result is a consequence of two general theorems valid for any Scott domain: the Dichotomy Theorem and the Extension Splitting Theorem. We briefly indicate that for propositional logic, the complexity of entailment is complete for co-NP(3).