Show simple item record

dc.contributor.authorSideris, A.en
dc.contributor.authorDimopoulos, Yannisen
dc.creatorSideris, A.en
dc.creatorDimopoulos, Yannisen
dc.date.accessioned2019-11-13T10:42:16Z
dc.date.available2019-11-13T10:42:16Z
dc.date.issued2010
dc.identifier.isbn978-1-57735-449-9
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54972
dc.description.abstractPlanning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization of constraints that are inferred from the problem planning graph. One of the recent improvements of the framework is the addition of long-distance mutual exclusion (londex) constraints that relate facts and actions which refer to different time steps. In this paper we compare different encodings of planning as satisfiability wrt the constraint propagation they achieve in a modern SAT solver. This analysis explains some of the differences observed in the performance of different encodings, and leads to some interesting conclusions. For instance, the BLACKBOX encoding achieves more propagation than the one of SATPLAN06, and therefore is a stronger formulation of planning as satisfiability. Moreover, our investigation suggests a new more compact and stronger model for the problem. We prove that in this new formulation many of the londex constraints are redundant in the sense that they do not add anything to the constraint propagation achieved by the model. Experimental results suggest that the theoretical results obtained are practically relevant. Copyright © 2010, Association for the Advancement of Artificial Intelligence. All rights reserved.en
dc.sourceICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Schedulingen
dc.source20th International Conference on Automated Planning and Scheduling, ICAPS 2010en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78149273170&partnerID=40&md5=642931c6369bdd32dfcf7ee5cdfa0844
dc.subjectEncoding (symbols)en
dc.subjectSchedulingen
dc.subjectTheoretical resulten
dc.subjectFormal logicen
dc.subjectPropositional satisfiabilityen
dc.subjectEncodingsen
dc.subjectSatisfiabilityen
dc.subjectSAT solversen
dc.subjectPlanning graphsen
dc.subjectPropositional planningen
dc.subjectBlack boxesen
dc.subjectConstraint propagationen
dc.subjectDifferent time stepsen
dc.subjectMutual exclusionsen
dc.titleConstraint propagation in propositional planningen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.description.startingpage153
dc.description.endingpage160
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: Artificial Intelligence Journalen
dc.description.notesEngineering and Physical Sciences Research Council (EPSRC)en
dc.description.notesNational ICT Australia, Research Centre of Excellenceen
dc.description.notesNational Science Foundation (NSF)en
dc.description.notesDavid Smithen
dc.description.notesConference code: 83049en
dc.description.notesCited By :14</p>en
dc.contributor.orcidDimopoulos, Yannis [0000-0001-9583-9754]
dc.gnosis.orcid0000-0001-9583-9754


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record