A temporally expressive planner based on answer set programming with constraints: preliminary design

Authors:
Forrest Sheng Bao;Sandeep Chintabathina;A. Ricardo Morales;Nelson Rushton;Richard Watson;Yuanlin Zhang
Affiliations:
Texas Tech University;Texas Tech University;Texas Tech University;Texas Tech University;Texas Tech University;Texas Tech University
Venue:
Logic programming, knowledge representation, and nonmonotonic reasoning
Year:
2011

Citing 12
Cited 0

Temporal planning with continuous change

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
MAPGEN: Mixed-Initiative Planning and Scheduling for the Mars Exploration Rover Mission

IEEE Intelligent Systems
Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Planning with problems requiring temporal coordination

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
Temporal planning using subgoal partitioning and resolution in SGPlan

Journal of Artificial Intelligence Research
When is temporal planning really temporal?

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Describing additive fluents in action language C+

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Branching and pruning: An optimal temporal POCL planner based on constraint programming

Artificial Intelligence
In defense of PDDL axioms

Artificial Intelligence
Multivalued action languages with constraints in CLP(FD)

ICLP'07 Proceedings of the 23rd international conference on Logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a new language ACC was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that ACC can be employed to build a temporally expressive planner for PDDL2.1. Compared with the existing planners, the new approach put less restrictions on the planning problems and is easy to extend with new features like PDDL axioms, thanks to the expressive power of ACC. More interestingly, it can also leverage the inference engine for ACC which has the potential to exploit the best reasoning mechanisms developed in the ASP, SAT and CP communities.