dc.contributor.author | Dimopoulos, Yannis | en |
dc.contributor.author | Gebser, M. | en |
dc.contributor.author | Lühne, P. | en |
dc.contributor.author | Romero, J. | en |
dc.contributor.author | Schaub, T. | en |
dc.contributor.editor | Balduccini M. | en |
dc.contributor.editor | Janhunen T. | en |
dc.creator | Dimopoulos, Yannis | en |
dc.creator | Gebser, M. | en |
dc.creator | Lühne, P. | en |
dc.creator | Romero, J. | en |
dc.creator | Schaub, T. | en |
dc.date.accessioned | 2019-11-13T10:39:54Z | |
dc.date.available | 2019-11-13T10:39:54Z | |
dc.date.issued | 2017 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53857 | |
dc.description.abstract | We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by SAT planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multi-valued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multi-shot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning. © Springer International Publishing AG 2017. | en |
dc.source | 14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85025123839&doi=10.1007%2f978-3-319-61660-5_26&partnerID=40&md5=2b6fb7c487539b6c6c53c9b5090bda31 | |
dc.subject | Computer circuits | en |
dc.subject | Logic programming | en |
dc.subject | Empirical analysis | en |
dc.subject | Encodings | en |
dc.subject | Fluents | en |
dc.subject | Multi-shot | en |
dc.subject | Multi-valued | en |
dc.subject | Planning algorithms | en |
dc.subject | Planning techniques | en |
dc.subject | Well-foundedness | en |
dc.title | Plasp 3: Towards effective ASP planning | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1007/978-3-319-61660-5_26 | |
dc.description.volume | 10377 LNAI | en |
dc.description.startingpage | 286 | |
dc.description.endingpage | 300 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Sponsors: | en |
dc.description.notes | Conference code: 193899</p> | en |
dc.source.abbreviation | Lect. Notes Comput. Sci. | en |
dc.contributor.orcid | Dimopoulos, Yannis [0000-0001-9583-9754] | |
dc.gnosis.orcid | 0000-0001-9583-9754 | |