Titlebook: Logic Programming and Nonmonotonic Reasoning; 14th International C Marcello Balduccini,Tomi Janhunen Conference proceedings 2017 Springer I

hurricane

From Logic Programming and Non-monotonic Reasoning to Computational Argumentation and Beyondogramming and non-monotonic reasoning origins of two well-known argumentation formalisms in AI (namely abstract argumentation and assumption-based argumentation). Finally, the talk will discuss recent developments in AI making use of computational argumentation, in particular to support collaborativ

量被毀壞

reject

A Hasse Diagram for Weighted Sceptical Semantics with a Unique-Status Grounded Semanticsntation: grounded, ideal, and eager. Being our framework based on a parametric structure of weights, we can directly compare weighted and classical approaches. We define a unique-status weighted grounded semantics, and we prove that the lattice of strongly-admissible extensions becomes a semi-lattic

浪費(fèi)時(shí)間

Foundations for a Probabilistic Event Calculusuage style syntax similar to that of the EC variant .odular-.. Its semantics is given in terms of . which constitute possible evolutions of the domain, and builds on that of Epistemic?Functional EC (EFEC). We also describe an ASP implementation of PEC and show the sense in which this is sound and co

PURG

Genome

Including Quantification in Defeasible Reasoning for the Description Logic ,ing. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend

bizarre

sphincter

RAGE

Gelfond-Zhang Aggregates as Propositional Formulasula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are r

NAUT

Answer Set Solving with Bounded Treewidth Revisitedpply this idea to the field of answer set programming (ASP). To this end, we propose two kinds of graph representations of programs to exploit their treewidth as a parameter. Treewidth roughly measures to which extent the internal structure of a program resembles a tree. Our main contribution is the