TY - JOUR
T1 - CASP solutions for planning in hybrid domains
AU - BALDUCCINI, MARCELLO
AU - MAGAZZENI, DANIELE
AU - MARATEA, MARCO
AU - LEBLANC, EMILY C.
PY - 2017/7/4
Y1 - 2017/7/4
N2 - Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.
AB - Constraint answer set programming (CASP) is an extension of answer set programming that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the ezcsp CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the ezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.
KW - Answer set programming
KW - hybrid domains
KW - planning
UR - http://www.scopus.com/inward/record.url?scp=85021819460&partnerID=8YFLogxK
U2 - 10.1017/S1471068417000187
DO - 10.1017/S1471068417000187
M3 - Article
AN - SCOPUS:85021819460
SN - 1471-0684
SP - 1
EP - 43
JO - Theory and Practice of Logic Programming
JF - Theory and Practice of Logic Programming
ER -