Skip to main content
SpringerLink
Log in

An abductive framework for extended logic programming

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

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

Abstract

We provide a simple formulation of a framework where three main extensions of logic programming for non-monotonic reasoning are treated uniformly: Negation-by-default, explicit negation and abduction. The resulting semantics is purely model-theoretic and gives meaning to any consistent abductive logic program. Moreover, it embeds and generalises existing semantics which deal with negation and abduction separately. The abductive framework is equipped with a correct top-down proof procedure.

The first author has been supported in part by C.N.R. grant 203.01.62.

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, P.M. Dung, and L.M. Pereira. Scenario semantics of extended logic programs. In L. M. Pereira and A. Nerode, editors, Proc. 2nd Int. Workshop on Logic Programming and Non Monotonic Reasoning, pages 334–348. The MIT Press, 1993.

    Google Scholar 

  2. J.J. Alferes, and L.M. Pereira. On logic program semantics with two kind of negation. In K. Apt, editor, Proc. Int. Joint Conf. and Symp. on Logic Programming, pages 574–588. The MIT Press, 1992.

    Google Scholar 

  3. K.R. Apt. Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 493–574. Elsevier Science Publisher, 1990.

    Google Scholar 

  4. A. Bondarenko, F. Toni, and R.A. Kowalski. An Assumption-based framework for nonmonotonic Reasoning, In L. M. Pereira and A. Nerode, editors, Proc. 2nd Int. Workshop on Logic Programming and Non Monotonic Reasoning, pages 171-189. The MIT Press, 1993.

    Google Scholar 

  5. G. Brewka, and K. Konolige. An Abductive Framework for General Logic Programs and other Nonmonotonic Systems. Proc. Int. Joint Conf. on Artificial Intelligence IJCAI93, pages 9–15. AAAI, 1993.

    Google Scholar 

  6. A. Brogi, E. Lamma, and P. Mello. Compositional Model-theoretic Semantics for Logic Programs. In New Generation Computing, 11(1):1–21. Springer-Verlag, 1992.

    Google Scholar 

  7. A. Brogi, E. Lamma, P. Mancarella, and P. Mello. Normal Logic Programs as Open Positive Programs. In K. Apt, editor, Proc. Int. Joint Conf. and Symp. on Logic Programming, pages 783–797. The MIT Press, 1992.

    Google Scholar 

  8. A. Brogi, E. Lamma, P. Mancarella, and P. Mello. A Unifying View of Logic Programming and Non-monotonic Reasoning. Tech. Report, University of Bologna and University of Pisa, December 1994.

    Google Scholar 

  9. M. Denecker, and D. De Schreye. SLDNFA: an abductive procedure for normal abductive programs. In K. Apt, editor, Proc. Int. Joint Conf. and Symp. on Logic Programming, pages 686–700. The MIT Press, 1992.

    Google Scholar 

  10. M. Denecker, and D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In Proc. International Logic Programming Symposium ILPS93, pages 147–163. The MIT Press, 1993.

    Google Scholar 

  11. J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. In A. Fuhrmann and H. Roth, editors, Logic, Action and Information. de Gruyter, Berlin-New York, 1994.

    Google Scholar 

  12. P.M. Dung. Negation as Hypothesis: An Abductive Foundation for Logic Programming. In K. Furukawa, editor, Proc. 8th Int. Conf. on Logic Programming ICLP91, pages 3–17. The MIT Press, 1991.

    Google Scholar 

  13. P.M. Dung. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning. In Proceedings Int. Joint Conf. on Artificial Intelligence IJCAI93, pages 852–857. AAAI, 1993.

    Google Scholar 

  14. P.M. Dung. An Argumentation Semantics for Logic Programming with Explicit Negation. In D.S. Warren, editor, Proc. 10th Int. Conf. on Logic Programming ICLP93, pages 616–630. The MIT Press, 1993.

    Google Scholar 

  15. P.M. Dung, and P. Ruamviboonsuk. Well-founded Reasoning with Classical Negation. In Proc.1st Int. Workshop on Logic Programming and Non-Monotonic Reasoning, pages 120–132. The MIT Press, 1991.

    Google Scholar 

  16. K. Eshghi, and R.A. Kowalski. Abduction Compared with Negation by Failure. In G. Levi and M. Martelli, editors, Proc. 6th Int. Conf. on Logic Programming ICLP89, pages 234–254. The MIT Press, 1989.

    Google Scholar 

  17. M. Gelfond, and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K.A. Bowen, editors, Proc. 5th Int. Conf. on Logic Programming, pages 1070–1080. The MIT Press, 1988.

    Google Scholar 

  18. M. Gelfond, and V. Lifschitz. Logic Programs with Classical Negation. In D.H.D. Warren and P. Szeredi, editors, Proc. 7th Int. Conf. on Logic Programming ICLP90, pages 579–597. The MIT Press, 1990.

    Google Scholar 

  19. A.C. Kakas, and P. Mancarella. Generalized stable models: a semantics for abduction. In Proceedings of 9th European Conference on Artificial Intelligence ECAI90, pages 385–391. Pitman Publishing, 1990.

    Google Scholar 

  20. A.C. Kakas, and P. Mancarella. On the relation between Truth Maintenance and Abduction. In Proceedings PRICAI90, 1990.

    Google Scholar 

  21. L.M. Pereira, and J.J. Alferes. Well-founded Semantics for Logic Programs with Explicit Negation. In Proc. ECAI92, John Wiley & Sons, 1992.

    Google Scholar 

  22. L.M. Pereira, J.N. Aparicio, and J.J. Alferes. Derivation Procedures for Extended Stable Models. In Proc. IJCAI91, pages 863–868. Morgan Kaufman 1991.

    Google Scholar 

  23. T.C. Przymusinski. Extended Stable Semantics for Normal and Disjunctive Programs. In D.H.D. Warren and P. Szeredi, editors, Proc. 7th Int. Conf. on Logic Programming, pages 459–477. The MIT Press, 1990.

    Google Scholar 

  24. T.C. Przymusinski. Semantics of Disjunctive Logic Programs and Deductive Databases. In Proc. DOOD'91, 1991.

    Google Scholar 

  25. F. Sadri, and R.A Kowalski. A Theorem-proving Approach to Database Integrity. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 313–362. Morgan-Kaufmann, 1988.

    Google Scholar 

  26. K. Satoh, and N. Iwayama. A Query Evaluation Method for Abductive Logic Programming. In K. Apt, editor, Proc. Int. Joint Conf. and Symp. on Logic Programming, pages 671–685. The MIT Press, 1992.

    Google Scholar 

  27. F. Teusink. A Proof Procedure for Extended Logic Programs. In Proceedings International Logic Programming Symposium ILPS93, pages 235–249. The MIT Press, 1993.

    Google Scholar 

  28. A. Van Gelder, K.A. Ross, and J.S. Schlipf. Unfounded sets and the well-founded semantics for general logic programs. In Proc. ACM SIGMOD-SIGACT, Symposium on Principles of Database Systems, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Antonio Brogi & Paolo Mancarella

  2. DEIS, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Evelina Lamma

  3. Dipartimento di Informatica, Università di Bari, Via Orabona 4, 70126, Bari, Italy

    Paola Mello

Authors
  1. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evelina Lamma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Mancarella
    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

Editor information

V. Wiktor Marek Anil Nerode M. Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brogi, A., Lamma, E., Mancarella, P., Mello, P. (1995). An abductive framework for extended logic programming. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-59487-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation