Abstract
In this paper we investigate three different approaches to encoding domain-dependent control knowledge for Answer-Set Planning. Starting with a standard implementation of the action description language B, we add control knowledge expressed in the GOLOG logic programming language. A naive encoding, following the original definitions of Levesque et al., is shown to scale poorly. We examine two alternative codings based on the transition semantics of ConGOLOG. We show that a speed increase of multiple orders of magnitude can be obtain by compiling the GOLOG program into a finitestate machine representation.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the National Conference on Artificial Intelligence |
| Place of Publication | Québec, Canada |
| Publisher | AI Access Foundation |
| Pages | 2352-2357 |
| Number of pages | 6 |
| Volume | 3 |
| ISBN (Electronic) | 9781577356790 |
| Publication status | Published - 2014 |
| Externally published | Yes |
| Event | 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 - Quebec City, Canada Duration: 27 Jul 2014 → 31 Jul 2014 |
Other
| Other | 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 |
|---|---|
| Country/Territory | Canada |
| City | Quebec City |
| Period | 27/07/14 → 31/07/14 |