Preferred extensions as stable models
Preferred extensions as stable models
About this item
Full title
Author / Creator
Publisher
Cambridge, UK: Cambridge University Press
Journal title
Language
English
Formats
Publication information
Publisher
Cambridge, UK: Cambridge University Press
Subjects
More information
Scope and Contents
Contents
Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P, after intersecting each stable model with the relevant atoms. The given mapping function is of polynomial size w.r.t. AF. In particular, we identify that t...
Alternative Titles
Full title
Preferred extensions as stable models
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_33432644
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_33432644
Other Identifiers
ISSN
1471-0684
E-ISSN
1475-3081
DOI
10.1017/S1471068408003359
