Daniel Gnad

12 papers · 2016–2026 · 2 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🏃 Academic Marathon (9) 🐝 Cross-Pollinator (6) 🌈 Renaissance Researcher (5) 🗺️ Taxonomy Completionist (12) 🌍 Conference Polyglot (2) 🏆 Keyword Champion (3) 🧬 Topic Evolution 💎 Century Club (11) 🚀 Conference Pioneer

Conferences

AAAI (6) IJCAI (6)

Top co-authors

Jorg Hoffmann (4) Alexander Shleyfman (3) Álvaro Torralba (2) David Speck (2) Augusto B. Corrêa (1) Carlos Areces (1) Peter Jonsson (1) Markus Fritzsche (1) Patrick Dubbert (1) Martin Wehrle (1)

Keywords

automated planning (4) classical planning (4) numeric planning (3) state space search (3) heuristic search (3) optimal planning (3) search algorithm (2) decoupled search (2) delete relaxation (2) quantitative reasoning (1) pattern database (1) propositional formula (1) red-black planning (1) fdr encoding (1) pattern database heuristic (1) task transformation (1) problem reformulation (1) plan synthesis (1) plan counting (1) abstraction heuristic (1)

Papers

Managing Infinite Abstractions in Numeric Pattern Database Heuristics AAAI 2026

PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning AAAI 2025

Counting and Reasoning with Plans AAAI 2025

Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning (Extended Abstract) IJCAI 2025

Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis AAAI 2023

Revisiting Dominance Pruning in Decoupled Search AAAI 2021

Custom-Design of FDR Encodings: The Case of Red-Black Planning IJCAI 2021

Learning How to Ground a Plan – Partial Grounding in Classical Planning AAAI 2019

Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search IJCAI 2018

Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search IJCAI 2017

On State-Dominance Criteria in Fork-Decoupled Search IJCAI 2016

Decoupled Strong Stubborn Sets IJCAI 2016