1.2k citations · 1.5k across the 15 of their papers we have counts for
17 papers
An efficient solver for ASP(Q)
Wolfgang Faber, Giuseppe Mazzotta, Francesco Ricca
Answer Set Programming with Quantifiers ASP(Q) extends Answer Set Programming (ASP) to allow for declarative and modular modeling of problems from the entire polynomial hierarchy.…
Aggregate Semantics for Propositional Answer Set Programs
Mario Alviano, Wolfgang Faber, Martin Gebser
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning. The attractiveness of ASP builds on an expressive high-level mode…
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming
Wolfgang Faber, Michael Morak, Lukáš Chrpa
In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the origina…
Thirty years of Epistemic Specifications
Jorge Fandinno, Wolfgang Faber, Michael Gelfond
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective li…
ASP-Core-2 Input Language Format
Francesco Calimeri, Wolfgang Faber, Martin Gebser +7
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual…
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…