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 条
  • [21] Everlasting Multi-party Computation
    Unruh, Dominique
    ADVANCES IN CRYPTOLOGY - CRYPTO 2013, PT II, 2013, 8043 : 380 - 397
  • [22] Multi-Party Functional Encryption
    Agrawal, Shweta
    Goyal, Rishab
    Tomida, Junichi
    THEORY OF CRYPTOGRAPHY, TCC 2021, PT II, 2021, 13043 : 224 - 255
  • [23] Covert multi-party computation
    Chandran, Nishanth
    Goyal, Vipul
    Ostrovsky, Rafail
    Sahai, Arnit
    48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 238 - 248
  • [24] Multi-party bidirectional teleportation
    Seida, C.
    El Allati, A.
    Metwally, N.
    Hassouni, Y.
    Optik, 2021, 247
  • [25] Multi-Party Quantum Steganography
    Mihara, Takashi
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2017, 56 (02) : 576 - 583
  • [26] Everlasting Multi-party Computation
    Dominique Unruh
    Journal of Cryptology, 2018, 31 : 965 - 1011
  • [27] MULTI-PARTY SYSTEM IN KERALA
    MAMMEN, PM
    INDIAN POLITICAL SCIENCE REVIEW, 1974, 8 (02): : 170 - 185
  • [28] Everlasting Multi-party Computation
    Unruh, Dominique
    JOURNAL OF CRYPTOLOGY, 2018, 31 (04) : 965 - 1011
  • [29] Multi-party elections in Africa
    Dorman, SR
    AFRICAN AFFAIRS, 2003, 102 (406) : 168 - 170
  • [30] Circuits and multi-party protocols
    Grolmusz, V
    COMPUTATIONAL COMPLEXITY, 1998, 7 (01) : 1 - 18