Skip to main content
SpringerLink
Log in

Computing the acceptability semantics

  • 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 present a proof theory and a proof procedure for nonmonotonic reasoning based on the acceptability semantics for logic programming, formulated in an argumentation framework. These proof theory and procedure are defined as generalisations of corresponding proof theories and procedures for the stable theory and preferred extension semantics. In turn, these can be seen as generalisations of the Eshghi-Kowalski abductive procedure for 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, L.M. Pereira, An argumentation-theoretic semantics based on nonrefutable falsity. Proc. Work. on Non-monotonic Extensions of LP, ICLP94

    Google Scholar 

  2. A. Bondarenko, F. Toni, R. A. Kowalski An assumption-based framework for nonmonotonic reasoning. Proc. 2nd International Workshop on Logic Programming and Non-monotonic Reasoning (1993)

    Google Scholar 

  3. P. M. Dung, Negation as hypothesis: an abductive foundation for logic programming. ICLP'91

    Google Scholar 

  4. P. M. Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming. IJCAI '93

    Google Scholar 

  5. K. Eshghi, R. A. Kowalski, Abduction compared with negation as failure. ICLP'89

    Google Scholar 

  6. A. C. Kakas, Default reasoning via negation as failure. Foundations of Knowledge Representation and Reasoning”, LNAI 810 Springer Verlag (1994)

    Google Scholar 

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

    Google Scholar 

  8. A. C. Kakas, P. Mancarella, Stable theories for logic programs. ISLP'91

    Google Scholar 

  9. A. C. Kakas, P. Mancarella, P.M. Dung, The Acceptability Semantics for Logic Programs. 1CLP'94

    Google Scholar 

  10. D. Poole A logical framework for default reasoning. Artificial Intelligence 36 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, 180 Queen's Gate, SW7 2BZ, London, UK

    Francesca Toni

  2. Department of Computer Science, University of Cyprus, 75 Kallipoleos Street Nicosia, P.O. Box 537, Cyprus

    Antonios C. Kakas

Authors
  1. Francesca Toni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonios C. Kakas
    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

Toni, F., Kakas, A.C. (1995). Computing the acceptability semantics. 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_29

Download citation

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

  • 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