Show simple item record

Extending planning graphs to an ADL subset

dc.contributor.authorKoehler, J.en
dc.contributor.authorNebel, B.en
dc.contributor.authorHoffmann, J.en
dc.contributor.authorDimopoulos, Yannisen
dc.creatorKoehler, J.en
dc.creatorNebel, B.en
dc.creatorHoffmann, J.en
dc.creatorDimopoulos, Yannisen
dc.date.accessioned2019-11-13T10:40:44Z
dc.date.available2019-11-13T10:40:44Z
dc.date.issued1997
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54271
dc.description.abstractWe describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators in such a way that almost all interesting properties of the original graph-plan algorithm are preserved.en
dc.source4th European Conference on Planning, ECP 1997en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84898681853&partnerID=40&md5=c19f1a24ed596a198ed155cbe16a0b7d
dc.subjectComputersen
dc.subjectArtificial intelligenceen
dc.subjectComputer scienceen
dc.subjectGraphplanen
dc.subjectPlanning graphsen
dc.titleExtending planning graphs to an ADL subseten
dc.typeinfo:eu-repo/semantics/article
dc.description.volume1348 LNAIen
dc.description.startingpage273
dc.description.endingpage285
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Sponsors:en
dc.description.notesConference code: 104575en
dc.description.notesCited By :85</p>en
dc.source.abbreviationLect. Notes Comput. Sci.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