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

預(yù)測

Gelfond-Zhang Aggregates as Propositional Formulasad, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterise a class of aggregates for which GZ- and F-semantics coincide.

弄臟

Modular Construction of Minimal Modelsze . of the largest connected component of the dependency graph, but their actual cost depends on the size of the largest source actually encountered, which can be far smaller than ., and on the class of theories to which sources belong. Indeed, if all sources reduce to an HCF or HEF theory, the algorithms are polynomial in the size of the theory.

delusion

Minimal Inference Problem Over Finite Domains: The Landscape of Complexitye use the algebraic approach provided originally in order to understand the complexity of the constraint satisfaction problem to give first non-trivial dichotomies and tractability results for the minimal inference problem over finite domains.

污點

SNEER

含沙射影

玷污

Vicious Circle Principle and Formation of Sets in ASP Based Languagesnction and infinite sets, the formal semantics of aggregates in . coincides with that of several other known languages. Their intuitive and formal semantics, however, are based on quite different ideas and seem to be more involved than that of ..

污點

Explaining Inconsistency in Answer Set Programs and Extensionseasoning problems related to the computation of such inconsistency reasons. Finally, we present a meta-programming encoding in disjunctive ASP which computes inconsistency reasons for given normal logic programs, and a basic procedural algorithm for computing inconsistency reasons for general .-programs.

演講