Stefan Woltran
35 papers · 2013–2025 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
🗺️ Taxonomy Completionist (25) 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Half 🌉 Interdisciplinary Bridge · Gold 🐣 Hot Topic Early Bird
🏠
Conference Loyalist
(24)
🔬
Deep Specialist
(11)
🏆
Keyword Champion
(5)
🧭
Keyword Pioneer
⚡
Prolific Year · Productive
📈
Trend Setter
❓
The Questioner
(2)
🗃️
Keyword Collector
(89)
🔥
Unstoppable · Silver
🚀
Conference Pioneer
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Keywords
answer set programming
(10)
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
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming
AAAI 2024
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting
IJCAI 2024
Epistemic Logic Programs: Non-Ground and Counting Complexity
IJCAI 2024
Redefining ABA+ Semantics via Abstract Set-to-Set Attacks
AAAI 2024
The Effect of Preferences in Abstract Argumentation under a Claim-Centric View
AAAI 2023
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck
IJCAI 2022
Tractable Abstract Argumentation via Backdoor-Treewidth
AAAI 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract)
IJCAI 2022
Choice Logics and Their Computational Properties
IJCAI 2021
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
AAAI 2021
The Complexity Landscape of Claim-Augmented Argumentation Frameworks
AAAI 2021
Structural Decompositions of Epistemic Logic Programs
AAAI 2020
Belief Revision Operators with Varying Attitudes Towards Initial Beliefs
IJCAI 2019
Complexity of Abstract Argumentation under a Claim-Centric View
AAAI 2019
Forgetting in Modular Answer Set Programming
AAAI 2019
Strong Equivalence for Epistemic Logic Programs Made Easy
AAAI 2019
Belief Update in the Horn Fragment
IJCAI 2018
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
Two Sides of the Same Coin: Belief Revision and Enforcing Arguments
IJCAI 2018
A General Notion of Equivalence for Abstract Argumentation
IJCAI 2017
On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
IJCAI 2017
The Impact of Treewidth on ASP Grounding and Solving
IJCAI 2017
ASP for Anytime Dynamic Programming on Tree Decompositions
IJCAI 2016
Distributing Knowledge into Simple Bases
IJCAI 2016
Investigating the Relationship between Argumentation Semantics via Signatures
IJCAI 2016
An Extension-Based Approach to Belief Revision in Abstract Argumentation
IJCAI 2015
Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract)
IJCAI 2015
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
IJCAI 2015
Merging in the Horn Fragment
IJCAI 2015
On the Parameterized Complexity of Belief Revision
IJCAI 2015
Abstract Dialectical Frameworks Revisited
IJCAI 2013
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
IJCAI 2013