Daniel Gnad
12 papers · 2016–2026 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Half 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (12)
🧬
Topic Evolution
🏆
Keyword Champion
(3)
💎
Century Club · Bronze
🚀
Conference Pioneer
Top co-authors
Research topics
Keywords
classical planning
(4)
automated planning
(4)
optimal planning
(3)
state-space search
(3)
heuristic search
(3)
numeric planning
(3)
delete relaxation
(2)
search algorithm
(2)
decoupled search
(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
Counting and Reasoning with Plans
AAAI 2025
Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning (Extended Abstract)
IJCAI 2025
PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning
AAAI 2025
Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis
AAAI 2023
Custom-Design of FDR Encodings: The Case of Red-Black Planning
IJCAI 2021
Revisiting Dominance Pruning in Decoupled Search
AAAI 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
Decoupled Strong Stubborn Sets
IJCAI 2016
On State-Dominance Criteria in Fork-Decoupled Search
IJCAI 2016