An argumentation-based interpreter for Golog programs

Authors:
Michelle L. Blom;Adrian R. Pearce
Affiliations:
NICTA Victoria Research Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne;NICTA Victoria Research Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 5
Cited 0

ConGolog, a concurrent programming language based on the situation calculus

Artificial Intelligence
Decision-Theoretic, High-Level Agent Programming in the Situation Calculus

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Planning with preferences using logic programming

Theory and Practice of Logic Programming
A General Framework for Expressing Preferences in Causal Reasoning and Planning

Journal of Logic and Computation
Web service composition via generic procedures and customizing user preferences

ISWC'06 Proceedings of the 5th international conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an argumentation-based 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 developed to discover these executions are limited in terms of how the preferences of an agent can be expressed, and the variety of preference types that can be used to guide search for a solution. The presented work combines the use of argumentation to compare executions relative to a set of general comparison principles, and the theory behind best first search to reduce the cost of the search process. To the best of our knowledge this is the first work to integrate argumentation and the interpretation of Golog programs, and to use argumentation as a tool for best first search.