PPaperPicks

Gregor Behnke

6 papers at tracked venues · 2 at CORE A* · active 20242025

Venues

Frequent coauthors

Papers

  1. Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning
  2. Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning
  3. Barely Decidable Fragments of Planning
  4. Contributions to the Journal Track
    ECAI 2024 · Gregor Behnke
  5. Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis
  6. Symbolic Reasoning Methods for AI Planning
    AAAI 2024 · Gregor Behnke