Updating Extended Logic Programs through Abduction | SpringerLink
Skip to main content
Springer Nature Link
Log in

Updating Extended Logic Programs through Abduction

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

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

  • 306 Accesses

Abstract

This paper introduces techniques for updating knowledge bases represented in extended logic programs. Three different types of updates, view updates, theory updates, and inconsistency removal, are considered. We formulate these updates through abduction, and provide methods for computing them with update programs. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the U-minimal answer sets of an update program. The proposed technique provides a uniform framework for these different types of updates, and each update is computed using existing procedures of logic programming.

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.

References

  1. J. J. Alferes and L. M. Pereira, Update programs can update programs, Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence 1216, pages 110–131, Springer, 1997.

    Article  MathSciNet  Google Scholar 

  2. J. J. Alferes, J. A. Leite, L. M. Pereira, H. Przymusinska, and T. Przymusinski. Dynamic logic programming. In: Proc. 6th Int’l Conf. Principles of Knowledge Representation and Reasoning, pages 98–109, Morgan Kaufmann, 1998.

    Google Scholar 

  3. F. Bry. Intensional updates: abduction via deduction. In: Proc. 7th Int’l Conf. Logic Programming, pages 561–575, MIT Press, 1990.

    Google Scholar 

  4. L. Console, M. L. Sapino, and D. T. Dupré. The role of abduction in database view updating. J. Intelligent Information Systems 4:261–280, 1995.

    Article  Google Scholar 

  5. C. V. Damásio and L. M. Pereira. Abduction over 3-valued extended logic programs. In: Proc. LPNMR’95, Lecture Notes in Artificial Intelligence 928, pages 29–42.

    Google Scholar 

  6. H. Decker. An extension of SLD by abduction and integrity maintenance for view updating in deductive databases. In: Proc. 1996 Joint Int’l Conf.& Symp. Logic Programming, pages 157–169, MIT Press.

    Google Scholar 

  7. T. Eiter, G. Gottlob, and N. Leone, Abduction from logic programs: semantics and complexity, Theoretical Computer Science 189(1-2):129–177, 1997.

    Article  MathSciNet  Google Scholar 

  8. R. Fagin, J. D. Ullman, and M. Y. Vardi. On the semantics of updates in databases (preliminary report). In: Proc. 2nd ACM SIGACT-SIGMOD Symp. Principles of Database Systems, pages 352–365, 1983.

    Google Scholar 

  9. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In: Proc. 7th Int’l Conf. Logic Programming, pages 579–597, MIT Press, 1990.

    Google Scholar 

  10. K. Inoue. Hypothetical reasoning in logic programs. J. Logic Programming 18:191–227, 1994.

    Article  MathSciNet  Google Scholar 

  11. K. Inoue and C. Sakama. Abductive framework for nonmonotonic theory change. In: Proc. IJCAI-95, pages 204–210, Morgan Kaufmann.

    Google Scholar 

  12. K. Inoue and C. Sakama. Specifying transactions for extended abduction. In: Proc. 6th Int’l Conf. Principles of Knowledge Representation and Reasoning, pages 394–405, Morgan Kaufmann, 1998.

    Google Scholar 

  13. A. C. Kakas and P. Mancarella. Database updates through abduction. In: Proc. 16th Int’l Conf. Very Large Databases, pages 650–661, Morgan Kaufmann, 1990.

    Google Scholar 

  14. T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In: J. Minker, (ed.), Foundations of Deductive Databases and Logic Programming, pages 193–216, Morgan Kaufmann, 1998.

    Google Scholar 

  15. K. Satoh and K. Iwayama. Computing abduction by using the TMS. In: Proc. 8th Int’l Conf. Logic Programming, pages 505–518, MIT Press, 1991.

    Google Scholar 

  16. Y. Zhang and N. Y. Foo. Updating logic programs. In: Proc. 13th European Conf. Artificial Intelligence, pages 403–407, Wiley, 1998.

    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. Department of Electrical and Electronics Engineering, Kobe University Rokkodai Nada, Kobe, 657 8501, 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 Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakama, C., Inoue, K. (1999). Updating Extended Logic Programs through Abduction. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics