Multi-Party Persuasion: a Paraconsistent Approach

被引:1
|
作者
Dunin-Keplicz, Barbara [1 ]
Powala, Alina [1 ]
机构
[1] Univ Warsaw, Inst Informat, Banacha 2, PL-02097 Warsaw, Poland
关键词
persuasion; multi-party dialogue; paraconsistent reasoning; nonmonotonic reasoning; conflict resolution; ARGUMENTATION; FRAMEWORK;
D O I
10.3233/FI-2018-1640
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Some conflicts appearing in multi-agent settings may be resolved via communication. In this paper, besides conflicts of opinions, paradigmatically resolved by a persuasion dialogue, we study semantically deeper conflicts reaching to motivations of opinions. This investigation led us to discerning deep persuasion dialogues aiming at the resolution of conflicting motivations of opinions. In our overall research program we focus on realistic modeling of agency. This includes a proper representation of agents' ignorance and inconsistencies, appearing in their informational stance. Therefore, our formal framework TalkLOG, designed to provide and embed different forms of dialogues, employs a 4-valued logic with two additional logical values, unknown and inconsistent. Within TalkLOG soundness and completeness of persuasion was proved by comparing the outcomes of the persuasion dialogues performed by n-agents with the outcomes obtained by merging knowledge of these n agents. In this context the key point was a proper construction of this merge operator. Another critical issue is complexity of agents' communication, which is typically interleaved with reasoning in the context of multi-agent or autonomous systems. In TalkLOG tractability of both aspects is obtained thanks to the implementation tool: rule-based 4-valued query language 4QL.
引用
收藏
页码:1 / 39
页数:39
相关论文
共 50 条
  • [1] Paraconsistent Multi-party Persuasion in TalkLOG
    Dunin-Keplicz, Barbara
    Strachocka, Alina
    PRIMA 2015: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS, 2015, 9387 : 265 - 283
  • [2] Threshold quantum secret sharing between multi-party and multi-party
    YANG YuGuang1
    2 State Key Laboratory of Integrated Services Network
    3 State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences)
    4 State Key Laboratory of Networking and Switching Technology
    Science China(Physics,Mechanics & Astronomy), 2008, (09) : 1308 - 1315
  • [3] Threshold quantum secret sharing between multi-party and multi-party
    YuGuang Yang
    QiaoYan Wen
    Science in China Series G: Physics, Mechanics and Astronomy, 2008, 51 : 1308 - 1315
  • [4] Threshold quantum secret sharing between multi-party and multi-party
    Yang YuGuang
    Wen QiaoYan
    SCIENCE IN CHINA SERIES G-PHYSICS MECHANICS & ASTRONOMY, 2008, 51 (09): : 1308 - 1315
  • [5] Multi-Party Campaigning
    Koutecky, Martin
    Talmon, Nimrod
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5506 - 5513
  • [6] A mechanism design approach for multi-party machine learning
    Chen, Mengjing
    Liu, Yang
    Shen, Weiran
    Shen, Yiheng
    Tang, Pingzhong
    Yang, Qiang
    THEORETICAL COMPUTER SCIENCE, 2024, 1003
  • [7] A Mechanism Design Approach for Multi-party Machine Learning
    Chen, Mengjing
    Liu, Yang
    Shen, Weiran
    Shen, Yiheng
    Tang, Pingzhong
    Yang, Qiang
    FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022, 2022, 13461 : 248 - 268
  • [8] A multi-party approach to SLA modeling - Application to WLANs
    Aib, I
    Agoulmine, N
    Pujolle, G
    CCNC: 2005 2ND IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE, 2005, : 451 - 455
  • [9] TinyKeys: A New Approach to Efficient Multi-Party Computation
    Hazay, Carmit
    Orsini, Emmanuela
    Scholl, Peter
    Soria-Vazquez, Eduardo
    JOURNAL OF CRYPTOLOGY, 2022, 35 (02)
  • [10] TinyKeys: A New Approach to Efficient Multi-Party Computation
    Hazay, Carmit
    Orsini, Emmanuela
    Scholl, Peter
    Soria-Vazquez, Eduardo
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, 2018, 10993 : 3 - 33