Optimising the interpretation of Golog programs with argumentation

Abstract

This paper presents some preliminary work toward the development of an argumentative interpreter for Golog programs. Traditional Golog interpreters are not designed to find the most preferred executions of a program from the perspective of an agent. Existing techniques that optimise the interpretation of Golog programs suffer from either a lack of exibility in how preference may be expressed or require the consideration of all program executions. The presented work combines the use of argumentation to compare executions relative to a set of general comparison criteria, and the theory behind informed search techniques to reduce the cost of the search process. The use of this argumentative informed search in the interpretation of ConGolog programs (with true concurrency), and its potential to find a program execution that is the most preferred by a collection of agents, is also discussed.