Optimising the interpretation of Golog programs with argumentation
Michelle L. Blom · 2008
Abstract. This paper presents some preliminary work toward the de-velopment of an argumentative interpreter for Golog programs [7]. Tra-ditional Golog interpreters are not designed to find the most preferred executions of a program from the perspective of an agent. Existing tech-niques that optimise the interpretation of Golog programs suffer from either a lack of flexibility in how preference may be expressed or require the consideration of all program executions. The presented work com-bines 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 argu-mentative informed search in the interpretation of ConGolog programs (with true concurrency) [3], and its potential to find a program execution that is the most preferred by a collection of agents, is also discussed. 1