CASP Solutions for Planning in Hybrid Domains

Marcello Balduccini, Drexel University, US
Daniele Magazzeni, King’s College London, UK
Marco Maratea, University of Genoa, Italy
Emily LeBlanc, Drexel University, US


CASP is an extension of ASP 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.

PDF Version


journal = {Theory and Practice of Logic Programming},
publisher = {Cambridge University Press},
author = {Marcello Balduccini and Daniele Magazzeni and Marco Maratea and Emily LeBlanc},
title = {CASP Solutions for Planning in Hybrid Domains},
note = {Special Issue on New Trends of Constraint Logic Programming},
editor= {Agostino Dovier},
volume = {17},
number = {4},
year = {2017},
pages = {591-633}