55 citations · 116 across the 7 of their papers we have counts for
7 papers
Complexity and Compilation of GZ-Aggregates in Answer Set Programming
Mario Alviano, Nicola Leone
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. The pap…
Disjunctive Datalog with Existential Quantifiers: Semantics, Decidability, and Complexity Issues
Mario Alviano, Wolfgang Faber, Nicola Leone +1
Datalog is one of the best-known rule-based languages, and extensions of it are used in a wide context of applications. An important Datalog extension is Disjunctive Datalog, which…
Magic Sets for Disjunctive Datalog Programs
Mario Alviano, Wolfgang Faber, Gianluigi Greco +1
In this paper, a new technique for the optimization of (partially) bound queries over disjunctive Datalog programs with stratified negation is presented. The technique exploits the…
Design and Implementation of Aggregate Functions in the DLV System
Wolfgang Faber, Gerald Pfeifer, Nicola Leone +2
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class SigmaP2 (…
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation
Simona Perri, Francesco Scarcello, Nicola Leone
Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abd…
Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming
Thomas Eiter, Wolfgang Faber, Nicola Leone +1
Most recently, Answer Set Programming (ASP) is attracting interest as a new paradigm for problem solving. An important aspect which needs to be supported is the handling of prefere…