Pascal Bercher

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

DBLP profile ↗ORCID search ↗

Venues

AAAI ×5 IJCAI ×4 ECAI ×3 ICAPS ×2 KR ×1

Frequent coauthors

Songtuan Lin

×4

Conny Olz

×3

Mohammad Yousefi

×3

Patrik Haslum

×3

Alexander Lodemann

×2

Pascal Lauer

×2

Daniel Lutalo

×1

Harrison Oates

×1

Hadyn Tang

×1

Sarath Sreedharan

×1

Mauro Vallati

×1

Michael Welt

×1

Papers

Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model Support
AAAI 2026 ·
Daniel Lutalo
, Pascal Bercher
Makespan Investigations of Sequential, Parallel, PO, and POCL Plans
AAAI 2026 ·
Harrison Oates
, Pascal Bercher
Symmetries and Other Variations of "End-Recursive" HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions
AAAI 2026 ·
Hadyn Tang
, Pascal Bercher
A Survey on Model Repair in AI Planning
IJCAI 2025 · Pascal Bercher,
Sarath Sreedharan
,
Mauro Vallati
Calculating Optimal Corrections for Unsolvable Planning Problems
ECAI 2025 ·
Michael Welt
,
Alexander Lodemann
,
Conny Olz
, Pascal Bercher,
Birte Glimm
Computational Complexity of Planning for Recursive Primitive Task Networks: Selective Action Nullification with State Preservation
IJCAI 2025 ·
Yifan Zhang
, Pascal Bercher
How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning
ICAPS 2025 ·
Mohammad Yousefi
,
Mario Schmautz
,
Patrik Haslum
, Pascal Bercher
Probabilistic HTN Planning: Formalization and Computational Complexity Analysis
KR 2025 ·
Mohammad Yousefi
,
Johannes Schmalz
,
Patrik Haslum
, Pascal Bercher
Repairing Planning Domains Based on Lifted Test Plans
ECAI 2025 ·
Nader Karimi Bavandpour
,
Pascal Lauer
,
Songtuan Lin
, Pascal Bercher
Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence
ICAPS 2025 ·
Pascal Lauer
,
Songtuan Lin
, Pascal Bercher
Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans
AAAI 2025 ·
Songtuan Lin
,
Alban Grastien
,
Rahul Shome
, Pascal Bercher
A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming
ECAI 2024 ·
Conny Olz
,
Alexander Lodemann
, Pascal Bercher
A Survey on Plan Optimization
IJCAI 2024 · Pascal Bercher,
Patrik Haslum
,
Christian Muise
Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)
IJCAI 2024 ·
Mohammad Yousefi
, Pascal Bercher
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence
AAAI 2024 ·
Songtuan Lin
,
Conny Olz
,
Malte Helmert
, Pascal Bercher