Abstract
Abstract In this article, we study procedural and declarative logics for defaults in modular orders. Brewkaâs prioritized default logic (PDL) and structured argumentation based on weakest link are compared to each other in different variants. This comparison takes place within the framework of attack relation assignments and the axioms (principles) recently proposed for them by Dung. To this end, we study which principles are satisfied by weakest link and disjoint weakest link attacks. With the aim of approximating PDL using argumentation, we identify an attack defined from PDL extensions, prove that each such PDL extension is a stable belief set under it and offer a similar principle-based analysis. We also prove an impossibility theorem for Dungâs axioms that covers PDL-inspired attack relation assignments. Finally, a novel variant of PDL with concurrent selection of defaults is also proposed, and compared to these argumentative approaches. In sum, our contributions fill an important gap in the literature created by Dungâs recent methods and open up new research questions on these methods.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call