| Pattern Selection Strategies for Pattern Databases in Probabilistic Planning. | 0 | 0.34 | 2022 |
| Classical Planning with Avoid Conditions. | 0 | 0.34 | 2022 |
| Landmark Heuristics for Lifted Classical Planning. | 0 | 0.34 | 2022 |
| Metamorphic Relations via Relaxations: An Approach to Obtain Oracles for Action-Policy Testing | 0 | 0.34 | 2022 |
| Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. | 0 | 0.34 | 2022 |
| Expressivity of Planning with Horn Description Logic Ontologies. | 0 | 0.34 | 2022 |
| Neural Network Action Policy Verification via Predicate Abstraction. | 0 | 0.34 | 2022 |
| Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search. | 0 | 0.34 | 2022 |
| Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study. | 0 | 0.34 | 2022 |
| Merge and Shrink Abstractions for Temporal Planning. | 0 | 0.34 | 2022 |
| Debugging a Policy: Automatic Action-Policy Testing in AI Planning. | 0 | 0.34 | 2022 |
| Faster Stackelberg Planning Via Symbolic Search And Information Sharing | 0 | 0.34 | 2021 |
| Making DL-Lite Planning Practical (Extended Abstract). | 0 | 0.34 | 2021 |
| Why Do I Have to Take Over Control? Evaluating Safe Handovers with Advance Notice and Explanations in HAD | 0 | 0.34 | 2021 |
| Polynomial-Time in PDDL Input Size - Making the Delete Relaxation Feasible for Lifted Planning. | 0 | 0.34 | 2021 |
| Learning Temporal Plan Preferences from Examples - An Empirical Study. | 0 | 0.34 | 2021 |
| Pattern Databases for Goal-Probability Maximization in Probabilistic Planning. | 0 | 0.34 | 2021 |
| Custom-Design of FDR Encodings - The Case of Red-Black Planning. | 0 | 0.34 | 2021 |
| Deep Statistical Model Checking. | 2 | 0.36 | 2020 |
| Tracking the Race Between Deep Reinforcement Learning and Imitation Learning. | 0 | 0.34 | 2020 |
| Generating Instructions at Different Levels of Abstraction | 0 | 0.34 | 2020 |
| Real-time Planning as Decision-making Under Uncertainty | 1 | 0.36 | 2019 |
| Towards automated network mitigation analysis. | 2 | 0.37 | 2019 |
| Comparative Criteria for Partially Observable Contingent Planning | 0 | 0.34 | 2019 |
| Refining Abstraction Heuristics During Real-Time Planning | 0 | 0.34 | 2019 |
| On the Relation between Star-Topology Decoupling and Petri Net Unfolding. | 0 | 0.34 | 2019 |
| Strong stubborn set pruning for star-topology decoupled state space search | 0 | 0.34 | 2019 |
| Advanced Factoring Strategies for Decoupled Search Using Linear Programming. | 0 | 0.34 | 2019 |
| Simulated Penetration Testing as Contingent Planning. | 0 | 0.34 | 2018 |
| Star-Topology Decoupling in SPIN. | 0 | 0.34 | 2018 |
| Formally Reasoning about the Cost and Efficacy of Securing the Email Infrastructure | 1 | 0.36 | 2018 |
| Compiling Probabilistic Model Checking into Probabilistic Planning. | 0 | 0.34 | 2018 |
| Star-topology decoupled state space search. | 0 | 0.34 | 2018 |
| Stackelberg Planning: Towards Effective Leader-Follower State Space Search. | 0 | 0.34 | 2018 |
| Symbolic Leaf Representation in Decoupled Search. | 0 | 0.34 | 2017 |
| Symmetry Breaking in Star-Topology Decoupled Search. | 1 | 0.34 | 2017 |
| Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning. | 0 | 0.34 | 2017 |
| Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. | 0 | 0.34 | 2017 |
| Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning. | 0 | 0.34 | 2017 |
| Beyond Red-Black Planning: Limited-Memory State Variables. | 0 | 0.34 | 2017 |
| Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. | 0 | 0.34 | 2017 |
| Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends. | 4 | 0.38 | 2016 |
| Decoupled Strong Stubborn Sets. | 2 | 0.36 | 2016 |
| Practical Undoability Checking via Contingent Planning. | 1 | 0.36 | 2016 |
| From Fork Decoupling to Star-Topology Decoupling | 3 | 0.40 | 2015 |
| Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions. | 12 | 0.52 | 2014 |
| SAP speaks PDDL: exploiting a software-engineering model for planning in business process management | 13 | 0.60 | 2014 |
| Analyzing search topology without running any search: on the connection between causal graphs and h+ | 33 | 1.05 | 2014 |
| BDD Ordering Heuristics for Classical Planning. | 5 | 0.40 | 2014 |
| Message-based web service composition, integrity constraints, and planning under uncertainty: a new connection | 25 | 0.82 | 2014 |
