Computational dialectics for argument-based agent systems

H. Swaamura, Y. Umeda, R. K. Meyer

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    12 Citations (Scopus)

    Abstract

    We introduce the static dialectical logics by Routley and Meyer (1976), and examine some dialectical inference rules to give them a breath of dialectical dynaminism of reasoning. Then we attempt to define Aufheben, compromise, reconciliation, etc., formally on top of the dialectical logics. Based on these results, we propose an argument-based agent system where several agents communicate, argue with each other and finally make a decision through argumentation, from knowledge bases distributed or dispersed on the network. If the agent system fails in attaining a consensus, then the Aufheben process attempts to make a dialectical agreement.

    Original languageEnglish
    Title of host publicationProceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages271-278
    Number of pages8
    ISBN (Electronic)0769506259, 9780769506258
    DOIs
    Publication statusPublished - 2000
    Event4th International Conference on MultiAgent Systems, ICMAS 2000 - Boston, United States
    Duration: 10 Jul 200012 Jul 2000

    Publication series

    NameProceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

    Conference

    Conference4th International Conference on MultiAgent Systems, ICMAS 2000
    Country/TerritoryUnited States
    CityBoston
    Period10/07/0012/07/00

    Fingerprint

    Dive into the research topics of 'Computational dialectics for argument-based agent systems'. Together they form a unique fingerprint.

    Cite this