Skip to main content
SpringerLink
Log in

Solving Abduction by Computing Joint Explanations: Logic Programming Formalization, Applications to P2P Data Integration, and Complexity Results

  • Conference paper
Book cover Foundations of Information and Knowledge Systems (FoIKS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3861))

  • 237 Accesses

Abstract

An extension of abduction is investigated where explanations for bunches of observations may be jointly computed by sets of interacting agents. At one hand, agents are allowed to partially contribute to the reasoning task, so that joint explanations can be singled out even if each agent does not have enough knowledge for carrying out abduction on its own. At the other hand, agents maintain their autonomy in choosing explanations, each one being equipped with a weighting function reflecting its perception about the reliability of set of hypotheses. Given that different agents may have different and possibly contrasting preferences, some reasonable notions of agents’ agreement are introduced, and their computational properties are thoroughly studied. As an example application of the framework discussed in the paper, it is shown how to handle data management issues in Peer-to-Peer systems and, specifically, how to provide a repair-based semantics to inconsistent ones.

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. Peirce, C.S.: Abduction and induction. In: Philosophical Writings of Peirce, pp. 150–156 (1955)

    Google Scholar 

  2. Denecker, M., Kakas, A.C.: Abduction in logic programming. Computational Logic: Logic Programming and Beyond, 402–436 (2002)

    Google Scholar 

  3. Kakas, A.C., Mancarella, P.: Generalized stable models: A semantics for abduction. In: Proc. of ECAI 1990, pp. 385–391 (1990)

    Google Scholar 

  4. Lin, F., You, J.H.: Abduction in logic programming: A new definition and an abductive procedure based on rewriting. In: Proc. of IJCAI 2001, pp. 655–666 (2001)

    Google Scholar 

  5. Console, L., Dupre, D.T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 1, 661–690 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kakas, A.C., Nuffelen, B.V., Denecker, M.: A-system: Problem solving through abduction. In: Proc. of IJCAI 2001, pp. 591–596 (2001)

    Google Scholar 

  7. Dung, P.M.: Negation as hypotheses: An abductive foundation for logic programming. In: Proc. of ICLP 1991, pp. 3–17 (1991)

    Google Scholar 

  8. Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The ciff proof procedure for abductive logic programming with constraints. In: Proc. of JELIA 2004, pp. 31–43 (2004)

    Google Scholar 

  9. Buccafurri, F., Gottlob, G.: Multiagent compromises, joint fixpoints, and stable models. In: Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I, pp. 561–585. Springer, London (2002)

    Google Scholar 

  10. Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42, 3–42 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Perri, S., Scarcello, F., Leone, N.: Abductive logic programs with penalization: Semantics, complexity and implementation. TPLP 5, 123–159 (2005)

    MATH  MathSciNet  Google Scholar 

  12. Abdelbar, A.M.: Approximating cost-based abduction is np-hard. Artificial Intelligence 159, 231–239 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kakas, A., Moraitis, P.: Argumentation based decision making for autonomous agents. In: Proc. of AAMAS 2003, pp. 883–890 (2003)

    Google Scholar 

  14. Arieli, O., Denecker, M., Nuffelen, B.V., Bruynooghe, M.: Coherent integration of databases by abductive logic programming. J. Artif. Intell. Research 21, 245–286 (2004)

    MATH  Google Scholar 

  15. Pivkina, I., Pontelli, E., Son, T.C.: Revising knowledge in multi-agent systems using revision programming with preferences. In: Proc. of CLIMA IV, pp. 134–158 (2004)

    Google Scholar 

  16. Mura, P.L., Shoham, Y.: Conditional, hierarchical, multi-agent preferences. In: Proc. of TARK 1998, pp. 215–224 (1998)

    Google Scholar 

  17. Faratin, P., de Walle, B.V.: Agent preference relations: Strict, indifferent, and incomparable. In: Proc. of AAMAS 2002, pp. 1317–1324 (2002)

    Google Scholar 

  18. Bracciali, A., Mancarella, P., Stathis, K., Toni, F.: On modelling multi-agent systems declaratively. In: Proc. of DALT 2004, pp. 53–68 (2004)

    Google Scholar 

  19. Nuffelen, B.V., Cortés-Calabuig, A., Denecker, M., Arieli, O., Bruynooghe, M.: Data integration using id-logic. In: Persson, A., Stirna, J. (eds.) CAiSE 2004. LNCS, vol. 3084, pp. 67–81. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Greco, G., Greco, S., Zumpano, E.: A logic programming approach to the integration, repairing and querying of inconsistent databases. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 348–364. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI 2003, pp. 16–21 (2003)

    Google Scholar 

  22. Bravo, L., Bertossi, L.: Logic programming for consistently querying data integration systems. In: Proc. of IJCAI 2003, pp. 10–15 (2003)

    Google Scholar 

  23. Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Logical foundations of peer-to-peer data integration. In: Proc. of PODS 2004, pp. 241–251 (2004)

    Google Scholar 

  24. Schlosser, M.T., Sintek, M., Decker, S., Nejdl, W.: Hypercup - hypercubes, ontologies, and efficient search on peer-to-peer networks. In: Proc. of AP2PC 2002, pp. 112–124 (2002)

    Google Scholar 

  25. Franconi, E., Kuper, G., Lopatenko, A., Serafini, L.: A robust logical and computational characterisation of peer-to-peer database systems. In: Proc. od DBISP2P 2003, pp. 64–76 (2003)

    Google Scholar 

  26. Bertossi, L.E., Bravo, L.: Query answering in peer-to-peer data exchange systems. In: Proc. of EDBT Workshops 2004, pp. 476–485 (2004)

    Google Scholar 

  27. Lenzerini, M.: Principles of p2p data integration. In: Proc. of DiWeb 2004, pp. 7–21 (2004)

    Google Scholar 

  28. Greco, G., Scarcello, F.: On the Complexity of Computing Peer Agreements for Consistent Query Answering in Peer-to-Peer Data Integration Systems. In: Proc. of CIKM 2005 (2005)

    Google Scholar 

  29. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS 2003, pp. 260–271 (2003)

    Google Scholar 

  30. Gottlob, G., Greco, G., Scarcello, F.: Pure nash equilibria: hard and easy games. Journal of Artificial Intelligence Research 24, 357–406 (2005)

    MATH  MathSciNet  Google Scholar 

  31. Krentel, M.W.: The Complexity of Optimization Problems. Journal of Computer and System Sciences 36(3), 490–509 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  32. Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: An abductive framework for information exchange in multi-agent systems. In: Proc. of CLIMA IV, pp. 34–52 (2004)

    Google Scholar 

  33. Hindriks, K.V., de Boer, F.S., van der Hoek, W., Meyer, J.J.C.: Semantics of communicating agents based on deduction and abduction. Issues in Agent Communication, 63–79 (2000)

    Google Scholar 

  34. Sadri, F., Toni, F., Torroni, P.: An abductive logic programming architecture for negotiating agents. In: Proc. of JELIA 2002, pp. 419–431 (2002)

    Google Scholar 

  35. Ciampolini, A., Lamma, E., Mello, P., Toni, F., Torroni, P.: Cooperation and competition in alias: A logic framework for agents that negotiate. Ann. Math. Artif. Intell. 37, 65–91 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  36. Ciampolini, A., Lamma, E., Mello, P., Torroni, P.: Laila: a language for coordinating abductive reasoning among logic agents. Comput. Lang. 27, 137–161 (2001)

    Article  Google Scholar 

  37. Schroeder, M., de Almeida Mora, I., Pereirat, L.M.: A deliberative and reactive diagnosis agent based on logic programming. In: Proc. of ICTAI 1996, p. 436 (1996)

    Google Scholar 

  38. Charniak, E., Shimony, S.: Cost-based abduction and map explanations. Artificial Intelligence 66, 345–374 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  39. Syrjänen, T., Niemelä, I.: The smodels system. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 434–438. Springer, Heidelberg (2001)

    Google Scholar 

  40. Leone, N., Pfeifer, G., Faber, W., Calimeri, F., Dell’Armi, T., Eiter, T., Gottlob, G., Ianni, G., Ielpa, G., Koch, C., Perri, S., Polleres, A.: The DLV System. In: Proc. of JELIA 2002, pp. 537–540 (2002)

    Google Scholar 

  41. Brewka, G., Niemelä, I., Truszczynski, M.: Answer set optimization. In: Proc. of IJCAI 2003, pp. 867–872 (2003)

    Google Scholar 

  42. Van Nieuwenborgh, D., Heymans, S., Vermeir, D.: On Programs with Linearly Ordered Multiple Preferences. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 180–194. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  43. De Vos, M., Crick, T., Padget, J., Brain, M., Cliffe, O., Needham, J.: Multi-agent Platform using Ordered Choice Logic Programming. In: Proc. of DALT 2005, pp. 67–83 (2005)

    Google Scholar 

  44. De Vos, M., Vermeir, D.: Choice Logic Programs and Nash Equilibria in Strategic Games. In: Proc. of CSL 1999, pp. 266–276 (1999)

    Google Scholar 

  45. Apt, K.R., Rossi, F., Venable, K.B.: CP-nets and Nash equilibria. In: Proc. of CIRAS 2005 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Matematica, Università della Calabria, 87030, Rende, Italy

    Gianluigi Greco

Authors
  1. Gianluigi Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clausthal University of Technology, Julius-Albert-Str. 4, 38678, Clausthal-Zellerfeld, Germany

    Jürgen Dix

  2. Department of Computing Science, Umeå University, SE-901 87, Umeå, Sweden

    Stephen J. Hegner

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, G. (2006). Solving Abduction by Computing Joint Explanations: Logic Programming Formalization, Applications to P2P Data Integration, and Complexity Results. In: Dix, J., Hegner, S.J. (eds) Foundations of Information and Knowledge Systems. FoIKS 2006. Lecture Notes in Computer Science, vol 3861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11663881_8

Download citation

  • DOI: https://doi.org/10.1007/11663881_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31782-1

  • Online ISBN: 978-3-540-31784-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation