Efficiently implementing GOLOG with answer set programming

Malcolm Ryan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

3 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Place of PublicationQuébec, Canada
PublisherAI Access Foundation
Pages2352-2357
Number of pages6
Volume3
ISBN (Electronic)9781577356790
Publication statusPublished - 2014
Externally publishedYes
Event28th 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 201431 Jul 2014

Other

Other28th 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
CountryCanada
CityQuebec City
Period27/07/1431/07/14

Fingerprint

Dive into the research topics of 'Efficiently implementing GOLOG with answer set programming'. Together they form a unique fingerprint.

Cite this