Abstract
This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between basic beliefs regarding the state of the world or the specification of the planning operators.
We introduce simple and efficient argument moves that enable discussion about planning steps, and show how these can be integrated into an existing protocol for belief argumentation. The resulting protocol is provably sound with regard to the defeasible semantics of the resulting agreements. We show how argument generation can be treated, for the specific task of argumentation about plans, by replacing the burden of finding proofs in a knowledge base by guided search.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–357 (1995)
Atkinson, K., Bench-Capon, T.: Practical reasoning as presumptive argumentation using action based alternating transition systems. Artificial Intelligence 171(10-15), 855–874 (2007)
Rahwan, I., Amgoud, L.: An argumentation based approach for practical reasoning. In: Proceedings of AAMAS 2006, pp. 347–354. ACM, New York (2006)
Tang, Y., Parsons, S.: Argumentation-based dialogues for deliberation. In: Proceedings of AAMAS 2005, pp. 552–559. ACM, USA (2005)
Pynadath, D.V., Tambe, M.: The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. Journal of Artificial Intelligence Research 16, 389–423 (2002)
Durfee, E.: Distributed Problem Solving and Planning. In: Weiß, G. (ed.) Multiagent Systems. A Modern Approach to Distributed Artificial Intelligence, pp. 121–164. MIT Press, USA (1999)
Lesser, V., Decker, K., Carver, N., Garvey, A., Neiman, D., Prasad, M., Wagner, T.: Evolution of the GPGP domain-independent coordination framework. Technical Report 98-05, Computer Science Department, UMASS (1998)
Garcia, D., Garcia, A., Simari, G.: Planning and defeasible reasoning. In: Proceedings of AAMAS 2007. ACM, USA (2007)
McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4 (1969)
Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Cambridge (2001)
Dunne, P.E., Bench-Capon, T.: Two party immediate response disputes: properties and efficiency. Artificial Intelligence 149(2), 221–250 (2003)
Vreeswijk, G., Prakken, H.: Credulous and sceptical argument games for preferred semantics. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzmán, I.P. (eds.) JELIA 2000. LNCS (LNAI), vol. 1919, pp. 239–253. Springer, Heidelberg (2000)
Parsons, S., Wooldridge, M.J., Amgoud, L.: An analysis of formal inter-agent dialogues. In: Proceedings of AAMAS 2002, pp. 394–401. ACM, USA (2002)
Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)
Nebel, B.: On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research 12, 271–315 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belesiotis, A., Rovatsos, M., Rahwan, I. (2010). A Generative Dialogue System for Arguing about Plans in Situation Calculus. In: McBurney, P., Rahwan, I., Parsons, S., Maudet, N. (eds) Argumentation in Multi-Agent Systems. ArgMAS 2009. Lecture Notes in Computer Science(), vol 6057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12805-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-12805-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12804-2
Online ISBN: 978-3-642-12805-9
eBook Packages: Computer ScienceComputer Science (R0)