55 citations · 277 across the 43 of their papers we have counts for
13 papers · 1 filter
Epistemic Logic Programs: Non-Ground and Counting Complexity
Thomas Eiter, Johannes K. Fichte, Markus Hecher +1
Answer Set Programming (ASP) is a prominent problem-modeling and solving framework, whose solutions are called answer sets. Epistemic logic programs (ELP) extend ASP to reason abou…
Choice Logics and Their Computational Properties
Michael Bernreiter, Jan Maly, Stefan Woltran
Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are formalisms for preference handling, with especially QCL being well established in the field of AI. So far, ana…
selp: A Single-Shot Epistemic Logic Program Solver
Manuel Bichler, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple…
On Uniform Equivalence of Epistemic Logic Programs
Wolfgang Faber, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years. This led to the development of new r…
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…
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Johannes K. Fichte, Markus Hecher, Michael Morak +1
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing pra…
Answer Set Solving with Bounded Treewidth Revisited
Johannes Fichte, Markus Hecher, Michael Morak +1
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of…
Counting Answer Sets via Dynamic Programming
Johannes Fichte, Markus Hecher, Michael Morak +1
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving pa…
lpopt: A Rule Optimization Tool for Answer Set Programming
Manuel Bichler, Michael Morak, Stefan Woltran
State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional prog…
Modularity Aspects of Disjunctive Stable Models
Tomi Janhunen, Emilia Oikarinen, Hans Tompits +1
Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we…
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…
Characterising equilibrium logic and nested logic programs: Reductions and complexity
David Pearce, Hans Tompits, Stefan Woltran
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of…
Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems
Philippe Besnard, Torsten Schaub, Hans Tompits +1
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this pa…