Concise finite-domain representations for PDDL planning tasks-Reference-Cited by-同舟云学术

Concise finite-domain representations for PDDL planning tasks

Published:2009-04 Issue:5-6 Volume:173 Page:503-535
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Helmert Malte

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference49 articles.

1. Complexity and Approximation;Ausiello,1999

2. Complexity results for SAS+ planning;Bäckström;Computational Intelligence,1995

3. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems, in: Boddy et al. [4], pp. 34–41

4. Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007),2007

5. Planning as heuristic search;Bonet;Artificial Intelligence,2001

Cited by 67 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving MaxSAT-Reordered Plans via Block Deordering;10th International Conference on Networking, Systems and Security;2023-12-21

2. Cyclic Action Graphs for goal recognition problems with inaccurately initialised fluents;Knowledge and Information Systems;2023-10-03

3. OMTPlan: A Tool for Optimal Planning Modulo Theories;Journal on Satisfiability, Boolean Modeling and Computation;2023-06-08

4. Verification of Numeric Planning Problems Through Domain Dynamic Consistency;AIxIA 2022 – Advances in Artificial Intelligence;2023

5. Plan Deordering with Conditional Effects;Lecture Notes in Networks and Systems;2022-09-01