Skip to main content
SpringerLink
Log in

Combining Answer Sets of Nonmonotonic Logic Programs

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3900))

Included in the following conference series:

Abstract

This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. Given two programs P 1 and P 2, which have the sets of answer sets AS(P 1) and AS(P 2), respectively; find a program Q which has answer sets as minimal sets S∪ T for S from AS(P 1) and T from AS(P 2). The program Q combines answer sets of P 1 and P 2, and provides a compositional semantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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., Kraus, S., Minker, J., Subrahmanian, V.S.: Combining knowledge base consisting of first-order theories. Computational Intelligence 8, 45–71 (1992)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1), 53–87 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brass, S., Dix, J.: Characterizations of the disjunctive stable semantics by partial evaluation. Journal of Logic Programming 32(3), 207–228 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  8. Brogi, A., Lamma, E., Mancarella, P., Mello, P.: A unifying view for logic programming with nonmonotonic reasoning. Theoretical Computer Science 184(1), 1–59 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bry, F.: A compositional semantics for logic programs and deductive databases. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 453–467. MIT Press, Cambridge (1996)

    Google Scholar 

  10. 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 

  11. Buccafurri, F., Faber, W., Leone, N.: Disjunctive programs with inheritance. In: Proceedings of the 1999 International Conference on Logic Programming, pp. 79–93. MIT Press, Cambridge (1999)

    Google Scholar 

  12. Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of Logic Programming 19/20, 443–502 (1994)

    Article  MathSciNet  Google Scholar 

  13. De Vos, M., Vermeir, D.: Extending answer sets for logic programming agents. Annals of Mathematics and Artificial Intelligence 42, 103–139 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Etalle, S., Teusink, F.: A compositional semantics for normal open programs. In: Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 468–482. MIT Press, Cambridge (1988)

    Google Scholar 

  15. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming 35(1), 39–78 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Konieczny, S., Pino-Pérez, R.: On the logic of merging. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, pp. 488–498. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  19. Leite, J.A.: Evolving Knowledge Bases, Specification and Semantics. IOS Press, Amsterdam (2003)

    MATH  Google Scholar 

  20. Liberatore, P., Schaerf, M.: Arbitration (or how to merge knowledge bases). IEEE Transactions on Knowledge and Data Engineering 10(1), 76–90 (1998)

    Article  Google Scholar 

  21. Pradhan, S., Minker, J.: Using priorities to combine knowledge bases. Journal of Cooperative Information Systems 5(2-3), 333–364 (1996)

    Article  Google Scholar 

  22. Sakama, C., Inoue, K.: Coordination between logical agents. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 161–177. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Verbaeten, S., Denecker, M., De Schreye, D.: Compositionality of normal open logic programs. In: Proceedings of the 1997 International Symposium on Logic Programming, pp. 371–385. MIT Press, Cambridge (1997)

    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

Editors and Affiliations

  1. Department of Computing, Imperial College London, UK

    Francesca Toni

  2. DEIS, University of Bologna, V.le Risorgimento 2, 40136, Bologna, Italy

    Paolo Torroni

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakama, C., Inoue, K. (2006). Combining Answer Sets of Nonmonotonic Logic Programs. In: Toni, F., Torroni, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2005. Lecture Notes in Computer Science(), vol 3900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750734_18

Download citation

  • DOI: https://doi.org/10.1007/11750734_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33996-0

  • Online ISBN: 978-3-540-33997-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation