Markus Hecher
24 papers · 2019–2026 · 2 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 ↓+9 more ↓ Show less ↑
🗺️ Taxonomy Completionist (24) 🏃 Academic Marathon · Sprint 🌍 Conference Polyglot · Bronze 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🤝
Dynamic Duo
(10)
🧬
Topic Evolution
🔬
Deep Specialist
(13)
🚀
Conference Pioneer
🔥
Unstoppable · Bronze
❓
The Questioner
(2)
⚡
Prolific Year · Productive
💎
Century Club · Bronze
🗃️
Keyword Collector
(78)
Venues
Top co-authors
Research topics
Keywords
answer set programming
(12)
argumentation framework
(6)
logic programming
(4)
parameterized complexity
(4)
abstract argumentation
(4)
computational complexity
(4)
quantitative reasoning
(3)
complexity analysis
(3)
dynamic programming
(3)
epistemic logic program
(3)
world view
(2)
disjunctive program
(2)
automated reasoning
(2)
logic-based argumentation
(2)
credulous reasoning
(2)
knowledge base
(2)
model counting
(2)
feedback vertex set
(1)
discrete mathematics
(1)
parallel computing
(1)
Papers
Structure-Aware Encodings of Argumentation Properties for Clique-width
AAAI 2026
Counting and Reasoning with Plans
AAAI 2025
Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases
AAAI 2025
Facets in Argumentation: A Formal Approach to Argument Significance
IJCAI 2025
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting
IJCAI 2024
Epistemic Logic Programs: Non-Ground and Counting Complexity
IJCAI 2024
Finite Groundings for ASP with Functions: A Journey through Consistency
IJCAI 2024
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
AAAI 2024
Parallel Empirical Evaluations: Resilience despite Concurrency
AAAI 2024
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
IJCAI 2024
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?
AAAI 2023
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity
AAAI 2023
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation
IJCAI 2023
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs
IJCAI 2023
ApproxASP – a Scalable Approximate Answer Set Counter
AAAI 2022
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck
IJCAI 2022
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach
IJCAI 2022
Tractable Abstract Argumentation via Backdoor-Treewidth
AAAI 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract)
IJCAI 2022
Decomposition-Guided Reductions for Argumentation and Treewidth
IJCAI 2021
Knowledge-Base Degrees of Inconsistency: Complexity and Counting
AAAI 2021
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
AAAI 2021
Structural Decompositions of Epistemic Logic Programs
AAAI 2020
Counting Complexity for Reasoning in Abstract Argumentation
AAAI 2019