Titlebook: Logic Programming and Nonmonotonic Reasoning; 10th International C Esra Erdem,Fangzhen Lin,Torsten Schaub Conference proceedings 2009 Sprin

保留

innovation

Splitting a CR-Prolog Program the introduction in A-Prolog of . (cr-rules for short), and allows an elegant formalization of events or exceptions that are unlikely, unusual, or undesired. The flexibility of the language has been extensively demonstrated in the literature, with examples that include planning and diagnostic reaso

條街道往前推

Contextual Argumentation in Ambient Intelligenceble context information render contextual reasoning a very challenging task. Most current Ambient Intelligence systems have not successfully addressed these challenges, as they rely on simplifying assumptions, such as perfect knowledge of context, centralized context, and unbounded computational and

FLAGR

刀鋒

A Revised Concept of Safety for General Answer Set Programsing a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas

Facilities

Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programst Programming (ASP) systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Lately, the research community is focusing on finding proper subclasses for which decidability of inference is guaran

Supplement

Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programsve context-dependent input from other modules, while allowing (mutually) recursive module calls. This can be used for more succinct and natural problem representation at the price of an exponential increase of evaluation time. In this paper, we aim at an efficient top-down evaluation of MLPs, consid

Substance-Abuse

Complexity of the Stable Model Semantics for Queries on Incomplete Databasesctive Datalog with negation under the stable model semantics. We consider both possible and certain answers and both closed- and open-world interpretation of . with and without conditions. By reduction to stable models of logic programs we find that, under closed-world interpretation, adding negatio

藐視

Manifold Answer-Set Programs for Meta-reasoningc program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking, it is often desirable to use (a subset of) brave or

鐵砧

A Deductive System for FO(ID) Based on Least Fixpoint Logicpaper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounded sets by least fixpoint expressions borrowed from st