Computing the acceptability semantics
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.
Unable to display preview. Download preview PDF.
- 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