1.2k citations · 1.5k across the 15 of their papers we have counts for
4 papers · 1 filter
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Wolfgang Faber, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of n…
On the Computation of Paracoherent Answer Sets
Giovanni Amendola, Carmine Dodaro, Wolfgang Faber +2
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is n…
Complexity of super-coherence problems in ASP
Mario Alviano, Wolfgang Faber, Stefan Woltran
Adapting techniques from database theory in order to optimize Answer Set Programming (ASP) systems, and in particular the grounding components of ASP systems, is an important topic…
Dynamic Magic Sets for Super-Consistent Answer Set Programs
Mario Alviano, Wolfgang Faber
For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore query optimization techniques for ASP are of great in…