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

Forrest Sheng Bao, Sandeep Chintabathina, A. Ricardo Morales, Nelson Rushton, Richard Watson, Yuanlin Zhang

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

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.

Original languageEnglish
Title of host publicationLogic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday
Pages398-414
Number of pages17
DOIs
StatePublished - 2011
EventSymposium on Constructive Mathematics in Computer Science - Lexington, KY, United States
Duration: Oct 25 2010Oct 26 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6565 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSymposium on Constructive Mathematics in Computer Science
CountryUnited States
CityLexington, KY
Period10/25/1010/26/10

Fingerprint Dive into the research topics of 'A temporally expressive planner based on answer set programming with constraints: Preliminary design'. Together they form a unique fingerprint.

Cite this