Skip to main content
SpringerLink
Log in

Rule Based Abduction

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2000)

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

Included in the following conference series:

Abstract

This paper introduces a procedural approach to perform rule based abduction in a knowledge base. In this context a knowledge base is realised as a normal abductive logic program, and an observation can be either a literal or a rule. A SLDNF resolution based proof procedure is employed to achieve this rule based abduction. It is shown that using this algorithm, one can always find a minimal explanation for the observation if there exists such an explanation.

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 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. A.C. Kakas, F. Toni and R.A. Kowalski, Abductive logic programming, Journal of Logic and Computation (1993) PP 719–770.

    Google Scholar 

  2. A.C. Kakas and P. Mancarella, Database updates through abduction. In Proceedings of the 16th VLDB Conference, pp 650–661, 1990.

    Google Scholar 

  3. S. Lakkaraju and Y. Zhang, A Procedural Approach for Rule Based Update In Proceedings of AI-99.

    Google Scholar 

  4. J.W. Lloyd, Foundations of Logic Programming, 2nd edition. Springer-Verlag, 1987.

    Google Scholar 

  5. C. Sakama and K. Inoue, Updating extended logic programs through abduction. In Proceedings of LPNMR-99, pp 147–161, 1999.

    Google Scholar 

  6. Y. Zhang and N.Y. Foo, Updating logic programs. In Proceedings of the 13th Europen Conference on Artificial Intelligence (ECAI’98), pp 403–407. John Wiley & Sons, Inc., 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, University of Western Sydney, NSW 2747, Nepean Kingswood, Australia

    Sai Kiran Lakkaraju & Yan Zhang

Authors
  1. Sai Kiran Lakkaraju
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, 01-237, Warsaw, Poland

    Zbigniew W. Raś

  2. Department of Computer Science, University of North Carolina, NC 28223, Charlotte, USA

    Zbigniew W. Raś

  3. Department of Science and Technology, Waseda University, 61-414, 3-4-1, Ohkubo, Shinjuku-ku, 169-8555, Tokyo, Japan

    Setsuo Ohsuga

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiran Lakkaraju, S., Zhang, Y. (2000). Rule Based Abduction. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-39963-1_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41094-2

  • Online ISBN: 978-3-540-39963-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation