Embedding Default Logic in Propositional Argumentation Systems
<|reference_start|>Embedding Default Logic in Propositional Argumentation Systems: In 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.<|reference_end|>
@article{berzati2002embedding,
    title={Embedding Default Logic in Propositional Argumentation Systems},
    author={Dritan Berzati, Bernhard Anrig and Juerg Kohlas},
    journal={arXiv preprint arXiv:cs/0207065},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0207065},
    primaryClass={cs.AI}
}