Files and links (1)
SubmittedOpen Access (License Unspecified), Open
Journal article
CASP solutions for planning in hybrid domains
Theory and practice of logic programming, v 17(4), pp 591-633
Jul 2017
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.
Metrics
Details
- Title
- CASP solutions for planning in hybrid domains
- Creators
- MARCELLO Balduccini - Saint Joseph's UniversityDANIELE Magazzeni - King's College LondonMARCO Maratea - University of GenoaEMILY C. Leblanc - Drexel University
- Publication Details
- Theory and practice of logic programming, v 17(4), pp 591-633
- Publisher
- Cambridge University Press
- Number of pages
- 43
- Resource Type
- Journal article
- Language
- English
- Web of Science ID
- WOS:000407039000007
- Scopus ID
- 2-s2.0-85021819460
- Other Identifier
- 991019318934004721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Computer Science, Software Engineering
- Computer Science, Theory & Methods
- Logic