Temporally expressive planning based on answer set programming with constraints

Forrest Sheng Bao, Yuanlin Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recently, a new language AC(C) was proposed to integrate answer set programming (ASP) and constraint logic programming (CLP). In this paper, we show that temporally expressive planning problems in PDDL2.1 can be translated into AC(C) and solved using AC(C) solvers. Compared with existing approaches, the new approach puts less restrictions on the planning problems and is easy to extend with new features like PDDL axioms. It can also leverage the inference engine for AC(C) which has the potential to exploit the best reasoning mechanisms developed in the ASP, SAT and CP communities. More details, including the proof to the correctness of the translation, are provided online at https://sites.google.com/site/pddl2acc/.

Original languageEnglish
Title of host publicationAAAI-12 / IAAI-12 - Proceedings of the 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference
Pages2413-2414
Number of pages2
StatePublished - 2012
Event26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12 - Toronto, ON, Canada
Duration: Jul 22 2012Jul 26 2012

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume3

Conference

Conference26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12
CountryCanada
CityToronto, ON
Period07/22/1207/26/12

Fingerprint Dive into the research topics of 'Temporally expressive planning based on answer set programming with constraints'. Together they form a unique fingerprint.

Cite this