Daniel Fišer
8 papers · 2018–2022 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
🌈 Renaissance Researcher (5) 🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (12) 🧭 Keyword Pioneer 🌍 Conference Polyglot (2)
🌉
Interdisciplinary Bridge
🐝
Cross-Pollinator
(4)
🏆
Keyword Champion
(2)
🔥
Unstoppable
(5)
🚀
Conference Pioneer
Conferences
AAAI (5)
IJCAI (3)
Top co-authors
Keywords
classical planning
(5)
lifted planning
(3)
automated planning
(3)
delete relaxation
(2)
computational complexity
(2)
mutex group
(2)
heuristic search
(2)
integer linear programming
(2)
admissible heuristic
(1)
symbolic search
(1)
strips planning
(1)
graph clique
(1)
optimal planning
(1)
red-black planning
(1)
fdr encoding
(1)
problem grounding
(1)
plan optimization
(1)
planning heuristics
(1)
operator mutex
(1)
structural symmetry
(1)
Papers
Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics
AAAI 2022
Operator-Potential Heuristics for Symbolic Search
AAAI 2022
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning
IJCAI 2021
Endomorphisms of Classical Planning Tasks
AAAI 2021
Custom-Design of FDR Encodings: The Case of Red-Black Planning
IJCAI 2021
Lifted Fact-Alternating Mutex Groups and Pruned Grounding of Classical Planning Problems
AAAI 2020
Operator Mutexes and Symmetries for Simplifying Planning Tasks
AAAI 2019
Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract)
IJCAI 2018