1
by Francesca Toni, Antonios C. Kakas
ftp://laotzu.doc.ic.ac.uk/pub/papers/Toni/accprocedure.ps.Z
Add To MetaCart
Abstract:
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 EshghiKowalski abductive procedure for logic programming. 1
Citations
| 394 | Abductive Logic Programming – Kakas, Kowalski, et al. - 1993 |
| 359 | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games – Dung - 1995 |
| 342 | A logical framework for default reasoning – Poole - 1988 |
| 173 | Abduction compared with negation by failure – Eshghi, Kowalski - 1989 |
| 51 | The acceptability semantics for logic programs – Kakas, Mancarella, et al. - 1994 |
| 47 | An assumption-based framework for non-monotonic reasoning – Bondarenko, Toni, et al. - 1993 |
| 35 | Negation as hypothesis: An abductive foundation for logic programming – Dung - 1991 |
| 29 | Stable theories for logic programs – Kakas, Mancarella - 1991 |
| 3 | An argumentation-theoretic semantics based on nonrefutable falsity – Alferes, Pereira - 1994 |
| 3 | Default reasoning via negation as failure – Kakas - 1994 |
