%0 Conference Paper %1 Baumann2023-uc %A Baumann, Ringo %A Heine, Anne-Marie %B Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning %C California %D 2023 %I International Joint Conferences on Artificial Intelligence Organization %K topic_knowledge %P 721--725 %T On conflict-free labellings -- realizability, construction and patterns of redundancy %X The paper deals with the topic of realizability in abstract argumentation. More precisely, we consider the most basic kind of labellings, so-called conflict-free labellings. The understanding of these labellings is essential as any mature labelling-based semantics selects its output among these labellings. We show how to decide whether a given set of labellings is the conflict-free outcome of a certain Dungean framework. To this end we introduce several new criteria like L-tightness, reject-witness and reject-compositionality. These properties play a decisive role in the central characterization theorem. Moreover, we present a construction method, showing how to realize a conflict-free realizable labelling-set. Finally, we study the representational freedom in case of such labellings. This leads to an uniqueness result for a certain sub-class and a surprising connection to strong equivalence in case of extension-based semantics.

@inproceedings{Baumann2023-uc, abstract = {The paper deals with the topic of realizability in abstract argumentation. More precisely, we consider the most basic kind of labellings, so-called conflict-free labellings. The understanding of these labellings is essential as any mature labelling-based semantics selects its output among these labellings. We show how to decide whether a given set of labellings is the conflict-free outcome of a certain Dungean framework. To this end we introduce several new criteria like L-tightness, reject-witness and reject-compositionality. These properties play a decisive role in the central characterization theorem. Moreover, we present a construction method, showing how to realize a conflict-free realizable labelling-set. Finally, we study the representational freedom in case of such labellings. This leads to an uniqueness result for a certain sub-class and a surprising connection to strong equivalence in case of extension-based semantics.}, added-at = {2024-09-10T10:41:24.000+0200}, address = {California}, author = {Baumann, Ringo and Heine, Anne-Marie}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/29cc1f6898cb6e39f49ba5dee811ff14d/scadsfct}, booktitle = {Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning}, conference = {20th International Conference on Principles of Knowledge Representation and Reasoning \{KR-2023\}}, interhash = {623caf913dcdb676fdb6424f9dd667e1}, intrahash = {9cc1f6898cb6e39f49ba5dee811ff14d}, keywords = {topic_knowledge}, location = {Rhodes, Greece}, month = sep, pages = {721--725}, publisher = {International Joint Conferences on Artificial Intelligence Organization}, timestamp = {2024-11-22T15:45:59.000+0100}, title = {On conflict-free labellings -- realizability, construction and patterns of redundancy}, year = 2023 }