Skip to main content
SpringerLink
Log in
Book cover

Congress of the Italian Association for Artificial Intelligence

AI*IA 2005: AI*IA 2005: Advances in Artificial Intelligence pp 135–147Cite as

The SCIFF Abductive Proof-Procedure

  • Conference paper

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

Abstract

We propose an operational framework which builds on the classical understanding of abductive reasoning in logic programming, and extends it in several directions. The new features include the ability to reason with a dynamic knowledge base, where new facts can be added anytime, the ability to generate expectations about such new facts occurring in the future (forecasting), and the process of confirmation/disconfirmation of such expectations.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

  2. Console, L., Dupré, 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 

  3. Kakas, A., Mancarella, P.: On the relation between Truth Maintenance and Abduction. In: Fukumura, T. (ed.) Proc. PRICAI 1990, pp. 438–443. Ohmsha Ltd (1990)

    Google Scholar 

  4. Satoh, K., Iwayama, N.: A Query Evaluation Method for Abductive Logic Programming. In: Apt, K. (ed.) Proc. ICLP 1992, pp. 671–685. MIT Press, Cambridge (1992)

    Google Scholar 

  5. Fung, T.H., Kowalski, R.A.: The IFF proof procedure for abductive logic programming. Journal of Logic Programming 33, 151–165 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. Journal of Logic Programming 44, 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kakas, A., van Nuffelen, B., Denecker, M.: \({\cal A}\)-System: Problem solving through abduction. In: Nebel, B. (ed.) Proc. IJCAI 2001, pp. 591–596. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  8. Alferes, J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming 4, 383–428 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Frühwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming 37, 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Compliance verification of agent interaction: a logic-based software tool. In: Applied Artificial Intelligence (to appear)

    Google Scholar 

  11. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Specification and verification of interaction protocols: a computational logic approach based on abduction. Technical Report CS-2003-03, Dipartimento di Ingegneria di Ferrara, Ferrara, Italy (2003), Available at, http://www.ing.unife.it/informatica/tr/

  12. Jaffar, J., Maher, M.: Constraint logic programming: a survey. Journal of Logic Programming 19-20, 503–582 (1994)

    Google Scholar 

  13. Bürckert, H.: A resolution principle for constrained logics. Artificial Intelligence 66, 235–271 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: An Abductive Interpretation for Open Societies. In: Cappelli, A., Turini, F. (eds.) AI*IA 2003. LNCS, vol. 2829, pp. 287–299. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Kowalski, R., Toni, F., Wetzel, G.: Executing suspended logic programs. Fundamenta Informaticae 34, 203–224 (1998)

    MATH  MathSciNet  Google Scholar 

  16. Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The CIFF proof procedure for abductive logic programming with constraints. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 31–43. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Sergot, M.J.: A query-the-user facility of logic programming. In: Degano, P., Sandwell, E. (eds.) Integrated Interactive Computer Systems, pp. 27–41. North Holland, Amsterdam (1983)

    Google Scholar 

  18. Evans, C., Kakas, A.: Hypotheticodedutive reasoning. In: Proc. International Conference on Fifth Generation Computer Systems,Tokyo, pp. 546–554 (1992)

    Google Scholar 

  19. Alferes, J., Brogi, A., Leite, J., Pereira, L.: Evolving logic programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 50–61. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by abduction under incomplete communication environments. In: Proc. ICMAS 2000, pp. 263–270. IEEE Press, Los Alamitos (2000)

    Google Scholar 

  21. Kowalski, R.A., Sergot, M.: A logic-based calculus of events. New Generation Computing 4, 67–95 (1986)

    Article  Google Scholar 

  22. Shanahan, M.P.: Reinventing Shakey. In: Minker, J. (ed.) Logic-based Artificial Intelligence. Series In Engineering and Computer Science, vol. 597, pp. 233–253. Kluwer Int., Dordrecht (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENDIF, Università di Ferrara,  

    Marco Alberti, Marco Gavanelli & Evelina Lamma

  2. DEIS, Università di Bologna,  

    Paola Mello & Paolo Torroni

Authors
  1. Marco Alberti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Gavanelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Evelina Lamma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paola Mello
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Paolo Torroni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Center on Complex Systems and Artificial Intelligence (CSAI) Department of Computer Science, Systems and Communication (DISCo), University of Milan, Bicocca viale Sarca, 336, 20126, Milan, (Italy)

    Stefania Bandini

  2. CSAI - Complex Systems & Artificial Intelligence Research Centre, University of Milano–Bicocca,  

    Sara Manzoni

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alberti, M., Gavanelli, M., Lamma, E., Mello, P., Torroni, P. (2005). The SCIFF Abductive Proof-Procedure. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_14

Download citation

  • DOI: https://doi.org/10.1007/11558590_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29041-4

  • Online ISBN: 978-3-540-31733-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation