CASP solutions for planning in hybrid domains. Issue 4 (4th July 2017)

• Record Type: Journal Article
• Authors: BALDUCCINI, MARCELLO; MAGAZZENI, DANIELE; MARATEA, MARCO; LEBLANC, EMILY C.
• Is Part Of: Theory and practice of logic programming. Volume 17:Issue 4(2017)
• Page Start: 591
• Page End: 633
• Publication Date: 2017-07-04
• Subjects: Answer set programming, -- planning, -- hybrid domains; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068417000187
• Languages: English
• ISSNs: 1471-0684

Abstract

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 theezcsp 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 theezcsp solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.