Skip to main content
SpringerLink
Log in

An Abductive Proof Procedure Handling Active Rules

  • Conference paper
AI*IA 2003: Advances in Artificial Intelligence (AI*IA 2003)

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

Included in the following conference series:

Abstract

We present a simple, though powerful extension of an abductive proof procedure proposed in the literature, the so-called KM-procedure, which allows one to properly treat more general forms of integrity constraints than those handled by the original procedure. These constraints are viewed as active rules, and their treatment allows the integration of a limited form of forward reasoning within the basic, backward reasoning framework upon which the KM-procedure is based. We first provide some background on Abductive Logic Programming and the KM-procedure and then formally present the extension, named AKM-procedure. The usefulness of the extension is shown by means of some simple examples.

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. Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation theoretic approach to default reasoning. Artificial Intelligence 93(1-2), 63–101 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. De necker, M., De Schreye, D.: SLDNFA: an abductive procedure for normal abductive programs. In: Apt, K. (ed.) Proc. International Conference and Symposium on Logic Programming, pp. 686–700. MIT press, Cambridge (1992)

    Google Scholar 

  3. Eshghi, K., Kowalski, R.A.: Abduction compared with negation by failure. In: Proc. 6th International Conference on Logic Programming, pp. 234–254. MIT Press, Cambridge (1989)

    Google Scholar 

  4. Fung, T.H., Kowalski, R.A.: The iff procedure for abductive logic programming. Journal of logic programming 33(2), 151–165 (1990)

    Article  MathSciNet  Google Scholar 

  5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programs. In: Bowen, K., Kowalski, R.A. (eds.) Proc. International Conference and Symposium on Logic Programming, pp. 1070–1080. MIT press, Cambridge (1988)

    Google Scholar 

  6. Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2(6), 719–770 (1993)

    Article  MathSciNet  Google Scholar 

  7. Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in Logic Programming. Handbook of Logic in AI and Logic Programming 5, 235–324 OUP (1998)

    MathSciNet  Google Scholar 

  8. Kakas, A.C., Mancarella, P.: Generalised stable models: a semantics for abduction. In: Proceedings 9th European Conference on AI, Pitman, pp. 385–391 (1990)

    Google Scholar 

  9. Kakas, A.C., Mancarella, P.: Abductive Logic Programming. In: Proceedings NACLP Workshop on Non-Monotonic Reasoning and Logic Programming, Austin (1990)

    Google Scholar 

  10. Kakas, A.C., Michael, A., Mourlas, C.: Aclp: Abductive constraint logic programming. Journal of Logic Programming 44(1-3), 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mancarella, P., Pedreschi, D., Ruggieri, S.: Negation as failure through abduction: reasoning about termination. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 240–272. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Sari, F., Toni, F., Torroni, P.: An abductive logic programming architecture for negotiating agents. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 419–431. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Sadri, F., Toni, F.: Abduction with Negation As Failure for Active and Reactive Rules. Department of Computing. Imperial College, London

    Google Scholar 

  14. Terreni, G.: Estensione di procedure abduttive al trattamento di vincoli attivi(i n Italian), Laurea Degree Thesis, Dipartimento di Informatica, Univ.di Pisa (2002)

    Google Scholar 

  15. Toni, F.: Abductive logic programming. PhD Thesis, Department of Computing, Imperial College, London (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, University of Pisa, Italy

    Paolo Mancarella & Giacomo Terreni

Authors
  1. Paolo Mancarella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giacomo Terreni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ISTI CNR, Area della Ricerca, Via G. Moruzzi 1, 56124, Pisa,, Italy

    Amedeo Cappelli

  2. Dipartimento di Informatica, University of Pisa, Italy

    Franco Turini

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mancarella, P., Terreni, G. (2003). An Abductive Proof Procedure Handling Active Rules. In: Cappelli, A., Turini, F. (eds) AI*IA 2003: Advances in Artificial Intelligence. AI*IA 2003. Lecture Notes in Computer Science(), vol 2829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39853-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39853-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20119-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation