Computing the acceptability semantics
Ημερομηνία
1995ISSN
0302-9743Source
3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995Volume
928Pages
401-415Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
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. © Springer-Verlag Berlin Heidelberg 1995.