← Authors

Stefan Woltran

35 papers · 2013–2025 · 3 conferences · across top CS/AI conferences

Achievements

🌈 Renaissance Researcher (6) πŸƒ Academic Marathon (12) 🧭 Keyword Pioneer 🐝 Cross-Pollinator (5) πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (25) 🐣 Hot Topic Early Bird 🌍 Conference Polyglot (3) 🏠 Conference Loyalist (24) πŸ”¬ Deep Specialist (11) πŸ† Keyword Champion (4) πŸ”₯ Unstoppable (11) ⚑ Prolific Year (5) πŸš€ Conference Pioneer πŸ’Ž Century Club (35) ❓ The Questioner (2) πŸ“ˆ Trend Setter πŸ—ƒοΈ Keyword Collector (90)

Conferences

IJCAI (24) AAAI (10) ACL (1)

Top co-authors

Wolfgang DvoΕ™Γ‘k (8) Adrian Haret (6) Markus Hecher (6) Thomas Linsbichler (4) Michael Morak (4) Stefan RΓΌmmele (3) Johannes Peter Wallner (3) Anna Rapberger (3) Markus Ulbricht (2) Matthias KΓΆnig (2)

Keywords

answer set programming (9) computational complexity (8) abstract argumentation (7) logic programming (5) argumentation semantics (5) epistemic logic program (4) complexity analysis (4) belief revision (3) argumentation framework (3) strong equivalence (3) preference handling (2) knowledge base (2) automated reasoning (2) reasoning task (2) formal argumentation (2) fixed-parameter tractability (2) propositional logic (2) knowledge representation (2) belief change (2) epistemic logic (2)

Papers

Understanding Verbatim Memorization in LLMs Through Circuit Discovery ACL 2025
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting IJCAI 2024
Redefining ABA+ Semantics via Abstract Set-to-Set Attacks AAAI 2024
Epistemic Logic Programs: Non-Ground and Counting Complexity IJCAI 2024
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming AAAI 2024
The Effect of Preferences in Abstract Argumentation under a Claim-Centric View AAAI 2023
Tractable Abstract Argumentation via Backdoor-Treewidth AAAI 2022
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck IJCAI 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract) IJCAI 2022
The Complexity Landscape of Claim-Augmented Argumentation Frameworks AAAI 2021
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021
Choice Logics and Their Computational Properties IJCAI 2021
Structural Decompositions of Epistemic Logic Programs AAAI 2020
Complexity of Abstract Argumentation under a Claim-Centric View AAAI 2019
Strong Equivalence for Epistemic Logic Programs Made Easy AAAI 2019
Forgetting in Modular Answer Set Programming AAAI 2019
Belief Revision Operators with Varying Attitudes Towards Initial Beliefs IJCAI 2019
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? IJCAI 2018
Single-Shot Epistemic Logic Program Solving IJCAI 2018
Belief Update in the Horn Fragment IJCAI 2018
Two Sides of the Same Coin: Belief Revision and Enforcing Arguments IJCAI 2018
The Impact of Treewidth on ASP Grounding and Solving IJCAI 2017
On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks IJCAI 2017
A General Notion of Equivalence for Abstract Argumentation IJCAI 2017
ASP for Anytime Dynamic Programming on Tree Decompositions IJCAI 2016
Investigating the Relationship between Argumentation Semantics via Signatures IJCAI 2016
Distributing Knowledge into Simple Bases IJCAI 2016
On the Parameterized Complexity of Belief Revision IJCAI 2015
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning IJCAI 2015
Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract) IJCAI 2015
Merging in the Horn Fragment IJCAI 2015
An Extension-Based Approach to Belief Revision in Abstract Argumentation IJCAI 2015
Abstract Dialectical Frameworks Revisited IJCAI 2013
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? IJCAI 2013