Daniel Gnad

Orcid: 0000-0001-7434-2669

Affiliations:
  • Linköping University, Sweden


According to our database1, Daniel Gnad authored at least 29 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Planning over Integers: Compilations and Undecidability.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Finding Matrix Multiplication Algorithms with Classical Planning.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Additive Pattern Databases for Decoupled Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Beyond Stars - Generalized Topologies for Decoupled Search.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Stern-Topologie Entkoppelte Zustandsraumsuche.
Proceedings of the Ausgezeichnete Informatikdissertationen 2021., 2021

Star-topology decoupled state-space search in AI planning and model checking.
PhD thesis, 2021

Custom-Design of FDR Encodings: The Case of Red-Black Planning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Model Checking ømega-Regular Properties with Decoupled Search.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Revisiting Dominance Pruning in Decoupled Search.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Planen.
Proceedings of the Handbuch der Künstlichen Intelligenz, 6. Auflage, 2020

2019
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search.
J. Artif. Intell. Res., 2019

Advanced Factoring Strategies for Decoupled Search Using Linear Programming.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

On the Relation between Star-Topology Decoupling and Petri Net Unfolding.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Learning How to Ground a Plan - Partial Grounding in Classical Planning.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Star-topology decoupled state space search.
Artif. Intell., 2018

Star-Topology Decoupling in SPIN.
Proceedings of the Model Checking Software - 25th International Symposium, 2018

Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Symbolic Leaf Representation in Decoupled Search.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Beyond Red-Black Planning: Limited-Memory State Variables.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Symmetry Breaking in Star-Topology Decoupled Search.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

On State-Dominance Criteria in Fork-Decoupled Search.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Decoupled Strong Stubborn Sets.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
From Fork Decoupling to Star-Topology Decoupling.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Red-Black Planning: A New Tractability Analysis and Heuristic Function.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Beating LM-Cut with h<sup>max</sup> (Sometimes): Fork-Decoupled State Space Search.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015


  Loading...