Constructing Consensus Logic Programs | SpringerLink
Skip to main content
Springer Nature Link
Log in

Constructing Consensus Logic Programs

  • Conference paper
Logic-Based Program Synthesis and Transformation (LOPSTR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4407))

Abstract

In this paper, we suppose an agent which has a knowledge base represented by a logic program under the answer set semantics. We then consider the following two problems: given two programs P 1 and P 2, which have the sets of answer sets \({\cal AS}{(P_1)}\) and \({\cal AS}{(P_2)}\), respectively; (i) find a program Q which has the answer sets as the minimal elements of \(\{\,S\,\cap\,T\,\mid\, S\in{\cal AS}{(P_1)}\;\mbox{and}\; T\in{\cal AS}{(P_2)}\,\}\); (ii) find a program R which has the answer sets as the maximal elements of the above set. A program Q satisfying (i) is called minimal consensus between P 1 and P 2; and R satisfying (ii) is called maximal consensus between P 1 and P 2. Minimal/maximal consensus extracts common beliefs that are included in an answer set of every program. Consensus provides a method of program development under a specification of constructing a program that reflects the meaning of two or more programs. In application, it contributes to a theory of building consensus in multi-agent systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Baral, C., Kraus, S., Minker, J.: Combining multiple knowledge bases. IEEE Transactions of Knowledge and Data Engineering 3(2), 208–220 (1991)

    Article  Google Scholar 

  2. Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming 19/20, 73–148 (1994)

    Article  MathSciNet  Google Scholar 

  3. Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40(1), 1–46 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Brogi, A., Contiero, S., Turini, F.: Programming by combining general logic programs. Journal of Logic and Computation 9(1), 7–24 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Foo, N., Meyer, T., Zhang, Y., Zhang, D.: Negotiating logic programs. In: Proceedings of the 6th Workshop on Nonmonotonic Reasoning, Action and Change (2005)

    Google Scholar 

  7. Gardner, P.A., Shepherdson, J.C.: Unfold/fold transformations of logic programs. In: Lassez, J-L., Plotkin, G. (eds.) Computational Logic, Essays in Honor of Alan Robinson, pp. 565–583. MIT Press, Cambridge (1991)

    Google Scholar 

  8. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–385 (1991)

    Article  Google Scholar 

  9. Inoue, K., Sakama, C.: Generality relations in answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 211–225. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundation of negotiation: outcome, concession and adaptation. In: Proc. AAAI-04, pp. 293–298. MIT Press, Cambridge (2004)

    Google Scholar 

  11. Sakama, C., Seki, H.: Partial deduction in disjunctive logic programming. Journal of Logic Programming 32(3), 229–245 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sakama, C., Inoue, K.: Coordination between logical agents. In: Leite, J.A., Torroni, P. (eds.) Computational Logic in Multi-Agent Systems. LNCS (LNAI), vol. 3487, pp. 161–177. Springer, Heidelberg (2005)

    Google Scholar 

  13. Sakama, C., Inoue, K.: Combining answer sets of nonmonotonic logic programs. In: Toni, F., Torroni, P. (eds.) Computational Logic in Multi-Agent Systems. LNCS (LNAI), vol. 3900, pp. 320–339. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Wooldridge, M., Parsons, S.: Languages for negotiation. In: Proceedings of the 14th European Conference on Artificial Intelligence, pp. 393–397. IOS Press, Amsterdam (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Communication Sciences, Wakayama University, Sakaedani, Wakayama 640-8510, Japan

    Chiaki Sakama

  2. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan

    Katsumi Inoue

Authors
  1. Chiaki Sakama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsumi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Germán Puebla

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Sakama, C., Inoue, K. (2007). Constructing Consensus Logic Programs. In: Puebla, G. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2006. Lecture Notes in Computer Science, vol 4407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71410-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71410-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71409-5

  • Online ISBN: 978-3-540-71410-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics