Skip to main content

Merging Belief Bases Represented by Logic Programs

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009)

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

Abstract

This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic merging operators described in the framework of propositional logic. The study of these operators leads to a new definition of the consequence relation between logic programs which is based on the logic of Here-and-There brought by Turner. Moreover, the specificity of the non-monotonic framework given by logic programming with stable model semantics allows for describing a weakened version of the merging operation. Once the operators are defined, their behaviour with respect to the Konieczny and Pino-Perez postulates for merging are examined and discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Anger, C., Konczak, K., Linke, T.: Nomore: Non-monotonic reasoning with logic programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS, vol. 2424, pp. 521–524. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS (LNAI), vol. 4483. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  3. Baral, C., Kraus, S., Minker, J., Subrahmanian, V.S.: Combining knowledge bases consisting of first order theories. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS, vol. 542, pp. 92–101. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  4. Bloch, I., Lang, J.: Towards mathematical morpho-logics. In: Technologies for constructing intelligent systems: tools, Heidelberg, Germany, pp. 367–380. Physica-Verlag GmbH (2002)

    Google Scholar 

  5. Cholvy, L.: Reasoning about merging information. In: Handbook of DRUMS, vol. 3, pp. 233–263 (1998)

    Google Scholar 

  6. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The kr system dlv: progress report, comparison and benchmarks. In: Proc. of KR 1998, pp. 406–417 (1998)

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the 5th Int. Conf. on Log. Prog, pp. 1070–1080 (1988)

    Google Scholar 

  8. Hue, J., Papini, O., Würbel, E.: Syntactic propositional belief bases fusion with removed sets. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS, vol. 4724, pp. 66–77. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Hue, J., Papini, O., Würbel, E.: Removed sets fusion: Performing off the shelf. In: Proc. of ECAI 2008 (2008)

    Google Scholar 

  10. Konieczny, S.: On the difference between merging knowledge bases and combining them. In: Proc of KR 2000, pp. 135–144. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  11. Konieczny, S., Pino Pérez, R.: On the logic of merging. In: Proc. of KR 1998, pp. 488–498 (1998)

    Google Scholar 

  12. Konieczny, S., Pino Pérez, R.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS, vol. 1638, p. 233. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Lin, F., Zhao, Y.: Assat: computing answer sets of a logic program by sat solvers. Artif. Intell. 157(1-2), 115–137 (2004)

    Article  MATH  Google Scholar 

  14. Lin, J.: Integration of weighted knowledge bases. AI 83, 363–378 (1996)

    Google Scholar 

  15. Lin, J., Mendelzon, A.O.: Merging databases under constraints. Int. Journal of Cooperative Information Systems 7(1), 55–76 (1998)

    Article  Google Scholar 

  16. Meyer, T., Ghose, A., Chopra, S.: Syntactic representations of semantic merging operations. In: Proc. of IJCAI 2001 (2001)

    Google Scholar 

  17. Niemelä, I., Simons, P.: An implementation of stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Revesz, P.Z.: On the semantics of theory change: arbitration between old and new information. In: 12th ACM SIGACT-SGMIT-SIGART symposium on Principes of Databases, pp. 71–92 (1993)

    Google Scholar 

  19. Revesz, P.Z.: On the semantics of arbitration. Journal of Algebra and Computation 7(2), 133–160 (1997)

    Article  MATH  Google Scholar 

  20. Fagin, R., Kuper, G.M., Ullman, J.D., Vardi, M.Y.: Updating logical databases. In: Advances in computing research, pp. 1–18 (1986)

    Google Scholar 

  21. Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory Pract. Log. Program. 3(4), 609–622 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hué, J., Papini, O., Würbel, E. (2009). Merging Belief Bases Represented by Logic Programs. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02906-6_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02905-9

  • Online ISBN: 978-3-642-02906-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics