Temporally Expressive Planning Based on Answer Set Programming with Constraints
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.
Cite
Text
Bao and Zhang. "Temporally Expressive Planning Based on Answer Set Programming with Constraints." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8423Markdown
[Bao and Zhang. "Temporally Expressive Planning Based on Answer Set Programming with Constraints." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/bao2012aaai-temporally/) doi:10.1609/AAAI.V26I1.8423BibTeX
@inproceedings{bao2012aaai-temporally,
title = {{Temporally Expressive Planning Based on Answer Set Programming with Constraints}},
author = {Bao, Forrest Sheng and Zhang, Yuanlin},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2012},
pages = {2413-2414},
doi = {10.1609/AAAI.V26I1.8423},
url = {https://mlanthology.org/aaai/2012/bao2012aaai-temporally/}
}