Automated Planning

Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models IJCAI 2021 Choosing the Initial State for Online Replanning AAAI 2021 Data-Driven Abstraction of Monotone Systems L4DC 2021 DeepSynth: Automata Synthesis for Automatic Task Segmentation in Deep Reinforcement Learning AAAI 2021 Discrete Reasoning Templates for Natural Language Understanding EACL 2021 Distributional Metareasoning for Heuristic Search IJCAI 2021 Faster and Better Simple Temporal Problems AAAI 2021 Landmark Generation in HTN Planning AAAI 2021 Learning Temporal Plan Preferences from Examples: An Empirical Study IJCAI 2021 LTL2Action: Generalizing LTL Instructions for Multi-Task RL ICML 2021 LTL-Constrained Steady-State Policy Synthesis IJCAI 2021 On Exploiting Hitting Sets for Model Reconciliation AAAI 2021 Online Learning of Action Models for PDDL Planning IJCAI 2021 On Weak Stubborn Sets in Classical Planning IJCAI 2021 Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks AAAI 2021 Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning IJCAI 2021 RADAR-X: An Interactive Interface Pairing Contrastive Explanations with Revised Plan Suggestions AAAI 2021 Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021 State-Based Recurrent SPMNs for Decision-Theoretic Planning under Partial Observability IJCAI 2021 Subgoal Search For Complex Reasoning Tasks NeurIPS 2021 Symbolic Dynamic Programming for Continuous State MDPs with Linear Program Transitions IJCAI 2021 Symbolic Search for Oversubscription Planning AAAI 2021 Team Papelo at FEVEROUS: Multi-hop Evidence Pursuit EMNLP 2021 The Future is not One-dimensional: Complex Event Schema Induction by Graph Modeling for Event Prediction EMNLP 2021 Using Online Planning and Acting to Recover from Cyberattacks on Software-defined Networks AAAI 2021