Answer Set Planning under Action Costs (2002)
Cached
Download Links
- [www.kr.tuwien.ac.at]
- [www.kr.tuwien.ac.at]
- [www.cs.washington.edu]
- [www.cs.cmu.edu]
- [www.wfaber.com]
- [www.wfaber.com]
- DBLP
Other Repositories/Bibliography
by
Thomas Eiter
,
Wolfgang Faber
,
Nicola Leone
,
Gerald Pfeifer
,
Axel Polleres
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 29 - 5 self |
BibTeX
@ARTICLE{Eiter02answerset,
author = {Thomas Eiter and Wolfgang Faber and Nicola Leone and Gerald Pfeifer and Axel Polleres},
title = {Answer Set Planning under Action Costs},
journal = {Journal of Artificial Intelligence Research},
year = {2002},
volume = {19},
pages = {186--197}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language K extends the declarative planning language K by action costs. K provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp.
