Fleebs-Logo
Details werden geladen...

Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory – International Center for Computational Logic

Hannes Strass, Johannes P. Wallner. Assumption-Based Argumentation Through the Lens of Approximation Fixpoint Theory. In Katie Atkinson, eds.,Proceedings of the Eleventh International Conference on Computational Models of Argument (COMMA), to appear.IOS Press

Ähnliche Seiten

https://iccl.inf.tu-dresden.de/web/Inproceedings3472

On the Complexity of Initial Models in Abstract Dialectical Frameworks – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/Inproceedings3472
https://iccl.inf.tu-dresden.de/web/Inproceedings3469

Lattice-Based Approaches for Enumerating Stable Extensions in Abstract Argumentation Frameworks – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/Inproceedings3469
https://iccl.inf.tu-dresden.de/web/TBA13

TBA – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/TBA13
https://iccl.inf.tu-dresden.de/web/TBA17

TBA – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/TBA17
https://iccl.inf.tu-dresden.de/web/TBA15

TBA – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/TBA15
https://iccl.inf.tu-dresden.de/web/Computing_Extensions_of_Abstract_Argumentation_Frameworks_by_Enumerating_Closed_Sets

Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets – International Center for Computational Logic

https://iccl.inf.tu-dresden.de/web/Computing_Extensions_of_Abstract_Argumentation_Frameworks_by_Enumerating_Closed_Sets