Pascal Bachor

2 papers at tracked venues · 1 at CORE A* · active 2024–2025

DBLP profile ↗ORCID search ↗

Venues

AAAI ×1 ICAPS ×1

Papers

Is This Plan Necessarily Redundant? On the Computational Complexity of Unobserved Domain Learning
ICAPS 2025 · Pascal Bachor
Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis
AAAI 2024 · Pascal Bachor