PPaperPicks

Markus Hecher

CRIL, Lens, France

17 papers at tracked venues · 5 at CORE A* · active 2024–2026

DBLP profile ↗ORCID 0000-0003-0131-6771 ↗Google Scholar ↗Homepage ↗

Venues

KR ×6AAAI ×5IJCAI ×5ECAI ×1

Frequent coauthors

Johannes Klaus Fichte
DBLP profile ↗ORCID search ↗
×3
Max Bannach
DBLP profile ↗ORCID search ↗
×2
Yasir Mahmood
DBLP profile ↗ORCID search ↗
×2
Alexander Beiser
DBLP profile ↗ORCID search ↗
×2
David Speck
DBLP profile ↗ORCID search ↗
×1
Daniel Gnad
DBLP profile ↗ORCID search ↗
×1
Damiano Azzolini
DBLP profile ↗ORCID search ↗
×1
Thomas Eiter
DBLP profile ↗ORCID search ↗
×1
Lukas Gerlach
DBLP profile ↗ORCID search ↗
×1
Dominik Rusovac
DBLP profile ↗ORCID search ↗
×1

Papers

  1. Counting Complexity of ASP
    KR 2026 ·
    Max Bannach
    DBLP profile ↗ORCID search ↗
  2. Structure-Aware Encodings of Argumentation Properties for Clique-width
    AAAI 2026 ·
    Yasir Mahmood
    DBLP profile ↗ORCID search ↗
  3. Counting Solutions Under Cardinality Constraints: Structure Counts in Counting
    KR 2025 ·
    Max Bannach
    DBLP profile ↗ORCID search ↗
  4. Counting and Reasoning with Plans
    AAAI 2025 ·
    David Speck
    DBLP profile ↗ORCID search ↗
  5. Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases
    AAAI 2025 ·
    Yasir Mahmood
    DBLP profile ↗ORCID search ↗
  6. Facets in Argumentation: A Formal Approach to Argument Significance
    IJCAI 2025 ·
    Johannes Klaus Fichte
    DBLP profile ↗ORCID search ↗
  7. FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding
    KR 2025 ·
    Alexander Beiser
    DBLP profile ↗ORCID search ↗
  8. Interactive Exploration of Plan Spaces
    KR 2025 ·
    Daniel Gnad
    DBLP profile ↗ORCID search ↗
  9. Reasoning with Restricted Statistical Statements in Probabilistic Answer Set Programming: Complexity and Algorithms
    KR 2025 ·
    Damiano Azzolini
    DBLP profile ↗ORCID search ↗
  10. Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting
    IJCAI 2024 ·
    Alexander Beiser
    DBLP profile ↗ORCID search ↗
  11. Epistemic Logic Programs: Non-Ground and Counting Complexity
    IJCAI 2024 ·
    Thomas Eiter
    DBLP profile ↗ORCID search ↗
  12. Finite Groundings for ASP with Functions: A Journey through Consistency
    IJCAI 2024 ·
    Lukas Gerlach
    DBLP profile ↗ORCID search ↗
  13. Navigating and Querying Answer Sets: How Hard Is It Really and Why?
    KR 2024 ·
    Dominik Rusovac
    DBLP profile ↗ORCID search ↗
  14. On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
    AAAI 2024 · Markus Hecher
  15. Parallel Empirical Evaluations: Resilience despite Concurrency
    AAAI 2024 ·
    Johannes Klaus Fichte
    DBLP profile ↗ORCID search ↗
  16. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
    IJCAI 2024 · Markus Hecher
  17. Rejection in Abstract Argumentation: Harder Than Acceptance?
    ECAI 2024 ·
    Johannes Klaus Fichte
    DBLP profile ↗ORCID search ↗