A SAT-based Approach for Argumentation Dynamics
Abstract
In the realm of multi-agent systems, argumentative dialogues for persuasion and negotiation involve autonomous agents exchanging arguments, necessitating continual re-evaluation of argument acceptability.
This study introduces a novel approach using modern SAT solving techniques to dynamically reassess the acceptability status of arguments, aligning with various classical semantics.
Our method uses the assumption mechanism in SAT solvers, distinguished by minimal assumptions, ensuring practicality.
Domains
Artificial Intelligence [cs.AI]| Origin | Files produced by the author(s) |
|---|