Abstract
This article studies coordination protocols between logical agents to answer queries to different types of combined programs. More precisely, we consider a system of agents corresponding to different logic programs under the answer set semantics, and different kind of coordination semantics to combine them: generous coordination (gathering all the answer sets of all agents), rigorous coordination (selecting answer sets shared by all agents), composition (building consistent union of answer sets from each agent) and consensus (taking intersection of answer sets from each agent). Rather than explicitly building a coordination program, which would require to compute all answer sets of each agent, we propose to use coordination protocols that would only compute answer sets that are needed to answer a query to the coordination. In this paper, after presenting our context and the coordination semantics we are using, we define coordination protocols for answering queries on them, translating constraints on the coordination into local constraints. Some examples are then given to illustrate the expressiveness of these basic types of coordination when combined together and possible applications are discussed.
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
Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming 19, 73–148 (1994)
Bochman, A.: Two representations for iterative non-prioritized change. In: Benferhat, S., Giunchiglia, E. (eds.) Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), Toulouse, France, April 19-21, pp. 135–141 (2002)
Brogi, A.: On the semantics of logic program composition. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol. 3049, pp. 115–151. Springer, Heidelberg (2004)
Brogi, A., Contiero, S., Turini, F.: Programming by combining general logic programs. Journal of Logic and Computation 9(1), 7–24 (1999)
Buccafurri, F., Gottlob, G.: Multiagent compromises, joint fixpoints, and stable models. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 561–585. Springer, Heidelberg (2002)
Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in ALIAS: A logic framework for agents that negotiate. Annals of Mathematics and Artificial Intelligence 37(1-2), 65–91 (2003)
Foo, N., Meyer, T., Zhang, Y., Zhang, D.: Negotiating logic programs. In: Proceedings of the 6th Workshop on Nonmonotonic Reasoning, Action and Change (NRAC 2005), Edinburgh, August 1, pp. 561–585. Springer, Heidelberg (2005)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–385 (1991)
Hopton, L., Cliffe, O., De Vos, M., Padget, J.A.: AQL: A query language for action domains modelled using answer set programming. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 437–443. Springer, Heidelberg (2009)
Sakama, C., Inoue, K.: Combining answer sets of nonmonotonic logic programs. In: Toni, F., Torroni, P. (eds.) CLIMA VI 2005. LNCS (LNAI), vol. 3900, pp. 320–339. Springer, Heidelberg (2006)
Sakama, C., Inoue, K.: Constructing consensus logic programs. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 26–42. Springer, Heidelberg (2007)
Sakama, C., Inoue, K.: Coordination in answer set programming. ACM Transaction on Computational Logic 9(2), 1–30 (2008)
Son, T.C., Pontelli, E., Sakama, C.: Logic programming for multiagent planning with negotiation. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 99–114. Springer, Heidelberg (2009)
Son, T.C., Sakama, C.: Reasoning and planning with cooperative actions for multiagents using answer set programming. In: Baldoni, M., Bentahar, J., van Riemsdijk, M.B., Lloyd, J. (eds.) DALT 2009. LNCS, vol. 5948, pp. 208–227. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourgne, G., Inoue, K. (2011). Query-Driven Coordination of Multiple Answer Sets. In: Omicini, A., Sardina, S., Vasconcelos, W. (eds) Declarative Agent Languages and Technologies VIII. DALT 2010. Lecture Notes in Computer Science(), vol 6619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20715-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-20715-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20714-3
Online ISBN: 978-3-642-20715-0
eBook Packages: Computer ScienceComputer Science (R0)