55 citations · 277 across the 43 of their papers we have counts for
48 papers
On Strong Equivalence Notions in Logic Programming and Abstract Argumentation
Giovanni Buraglio, Wolfgang Dvorak, Stefan Woltran
Strong equivalence between knowledge bases ensures the possibility of replacing one with the other without affecting reasoning outcomes, in any given context. This makes it a cruci…
Splitting Assumption-Based Argumentation Frameworks
Giovanni Buraglio, Wolfgang Dvorak, Stefan Woltran
Assumption-Based Argumentation (ABA) is a well-established formalism for modelling and reasoning over debates, with a wide range of applications. However, the high computational co…
Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
Alexander Beiser, Markus Hecher, Stefan Woltran
The grounding bottleneck poses one of the key challenges that hinders the widespread adoption of Answer Set Programming in industry. Hybrid Grounding is a step in alleviating the b…
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…
Visualizing Extensions of Argumentation Frameworks as Layered Graphs
Martin Nöllenburg, Christian Pirker, Anna Rapberger +2
The visualization of argumentation frameworks (AFs) is crucial for enabling a wide applicability of argumentative tools. However, their visualization is often considered only as an…
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming
Zeynep G. Saribatur, Stefan Woltran
Answer Set Programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to c…