On Concise Encodings of Preferred Extensions

Simple item page
dc.creatorDunne, Paul E.
dc.date2002-07-08
dc.date.accessioned2026-07-07T03:18:36Z
dc.date.available2026-07-07T03:18:36Z
dc.descriptionMuch work on argument systems has focussed on preferred extensions which define the maximal collectively defensible subsets. Identification and enumeration of these subsets is (under the usual assumptions) computationally demanding. We consider approaches to deciding if a subset S is a preferred extension which query a representations encoding all such extensions, so that the computational effort is invested once only (for the initial enumeration) rather than for each separate query.
dc.descriptionProc. 9th Worskhop on Non-monotonic reasoning, Toulouse, 2002 (NMR'02) (7 pages)
dc.identifierhttps://arxiv.org/abs/cs/0207024
dc.identifierhttp://arxiv.org/abs/cs/0207024
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31181
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectF.2.m; I.2.3; I.2.m
dc.titleOn Concise Encodings of Preferred Extensions
dc.typetext

Files

Collections

arXiv