Computer Science – Artificial Intelligence
Scientific paper
2002-07-16
Computer Science
Artificial Intelligence
9 pages
Scientific paper
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.
Anrig Bernhard
Berzati Dritan
Kohlas Juerg
No associations
LandOfFree
Embedding Default Logic in Propositional Argumentation Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Embedding Default Logic in Propositional Argumentation Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding Default Logic in Propositional Argumentation Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-42840