Complete Assumption Labellings

被引：5
|
作者：
Schulz, Claudia [1 ]
Toni, Francesca [1 ]
机构：
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England
来源：
COMPUTATIONAL MODELS OF ARGUMENT | 2014年 / 266卷
关键词：
Assumption-Based Argumentation; Complete Semantics; Labelling Semantics;
D O I：
10.3233/978-1-61499-436-7-405
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Recently, argument labellings have been proposed as a new (equivalent) way to express the extension semantics of Abstract Argumentation (AA) frameworks. Here, we introduce a labelling approach for the complete semantics in Assumption-Based Argumentation (ABA), where labels are assigned to assumptions rather than whole arguments. We prove that the complete assumption labelling corresponds to the complete extension semantics in ABA, as well as to the complete extension semantics and the complete argument labelling in AA.
引用
收藏
页码：405 / 412
页数：8
相关论文
共 50 条
  • [1] Labellings for assumption-based and abstract argumentation
    Schulz, Claudia
    Toni, Francesca
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2017, 84 : 110 - 149
  • [2] Antimagic labellings of the complete graphs with a common vertex
    Arisoy, M.
    International Journal of Mathematical Education in Science and Technology, 29 (02):
  • [3] Optimal radio labellings of complete m-ary trees
    Li, Xiangwen
    Mak, Vicky
    Zhou, Sanming
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 507 - 515
  • [4] Triangular embeddings of complete graphs from graceful labellings of paths
    Goddyn, Luis
    Richter, R. Bruce
    Siran, Jozef
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (06) : 964 - 970
  • [5] Real-graceful labellings: a generalisation of graceful labellings
    Vietri, Andrea
    ARS COMBINATORIA, 2011, 102 : 359 - 364
  • [6] L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
    Peter Che Bor Lam
    Wensong Lin
    Jianzhuan Wu
    Journal of Combinatorial Optimization, 2007, 14 : 219 - 227
  • [7] L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
    Lam, Peter Che Bor
    Lin, Wensong
    Wu, Jianzhuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (2-3) : 219 - 227
  • [8] BOUNDS FOR THE REAL NUMBER GRAPH LABELLINGS AND APPLICATION TO LABELLINGS OF THE TRIANGULAR LATTICE
    Kral, Daniel
    Skoda, Petr
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (04) : 1559 - 1569
  • [9] DETERMINATION OF COMPLETE ODFS UNDER ASSUMPTION OF A MINIMAL VALUE
    WAGNER, F
    HUMBERT, M
    ESLING, C
    MULLER, J
    TEXTURES AND MICROSTRUCTURES, 1991, 14 : 45 - 51
  • [10] Distance labellings of graphs
    Shao, Zhendong
    Zhang, David
    ARS COMBINATORIA, 2013, 108 : 23 - 31
12345