Embedding Default Logic in Propositional Argumentation Systems

Simple item page
dc.creatorBerzati, Dritan
dc.creatorAnrig, Bernhard
dc.creatorKohlas, Juerg
dc.date2002-07-16
dc.date.accessioned2026-07-07T03:18:41Z
dc.date.available2026-07-07T03:18:41Z
dc.descriptionIn this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered without leaving the field of classical propositional logic. The transformation proposed is linear in the number of defaults.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/cs/0207065
dc.identifierhttp://arxiv.org/abs/cs/0207065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31215
dc.subjectArtificial Intelligence
dc.subjectI.2.3; I.2.4
dc.titleEmbedding Default Logic in Propositional Argumentation Systems
dc.typetext

Files

Collections

arXiv