CASP Solutions for Planning in Hybrid Domains
Abstract. 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.
Balduccini, Marcello, Daniele Magazzeni, Marco Maratea, and Emily C. Leblanc. "CASP Solutions for Planning in Hybrid Domains." Theory and Practice of Logic Programming 17.4 (2017: July): 591-633.
This document is currently not available here.