dc.contributor.author | Koehler, J. | en |
dc.contributor.author | Nebel, B. | en |
dc.contributor.author | Hoffmann, J. | en |
dc.contributor.author | Dimopoulos, Yannis | en |
dc.creator | Koehler, J. | en |
dc.creator | Nebel, B. | en |
dc.creator | Hoffmann, J. | en |
dc.creator | Dimopoulos, Yannis | en |
dc.date.accessioned | 2019-11-13T10:40:44Z | |
dc.date.available | 2019-11-13T10:40:44Z | |
dc.date.issued | 1997 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54271 | |
dc.description.abstract | We 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.source | 4th European Conference on Planning, ECP 1997 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84898681853&partnerID=40&md5=c19f1a24ed596a198ed155cbe16a0b7d | |
dc.subject | Computers | en |
dc.subject | Artificial intelligence | en |
dc.subject | Computer science | en |
dc.subject | Graphplan | en |
dc.subject | Planning graphs | en |
dc.title | Extending planning graphs to an ADL subset | en |
dc.type | info:eu-repo/semantics/article | |
dc.description.volume | 1348 LNAI | en |
dc.description.startingpage | 273 | |
dc.description.endingpage | 285 | |
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: 104575 | en |
dc.description.notes | Cited By :85</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 | |