Formal Verification of Debates in Argumentation Theory

12/12/2019
by   Ria Jha, et al.
0

Humans engage in informal debates on a daily basis. By expressing their opinions and ideas in an argumentative fashion, they are able to gain a deeper understanding of a given problem and in some cases, find the best possible course of actions towards resolving it. In this paper, we develop a methodology to verify debates formalised as abstract argumentation frameworks. We first present a translation from debates to transition systems. Such transition systems can model debates and represent their evolution over time using a finite set of states. We then formalise relevant debate properties using temporal and strategy logics. These formalisations, along with a debate transition system, allow us to verify whether a given debate satisfies certain properties. The verification process can be automated using model checkers. Therefore, we also measure their performance when verifying debates, and use the results to discuss the feasibility of model checking debates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2020

From Well Structured Transition Systems to Program Verification

We describe the use of the theory of WSTS for verifying programs....
research
02/18/2022

Towards the Combination of Model Checking and Runtime Verification on Multi-Agent Systems

Multi-Agent Systems (MAS) are notoriously complex and hard to verify. In...
research
09/07/2021

Failure Analysis of Hadoop Schedulers using an Integration of Model Checking and Simulation

The Hadoop scheduler is a centerpiece of Hadoop, the leading processing ...
research
05/02/2019

Logic-based Specification and Verification of Homogeneous Dynamic Multi-agent Systems

We develop a logic-based framework for formal specification and algorith...
research
09/13/2023

Timed Actors and Their Formal Verification

In this paper we review the actor-based language, Timed Rebeca, with a f...
research
02/14/2018

Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)

Variational systems allow effective building of many custom variants by ...
research
06/07/2023

Fully Automated Verification of Linear Time-Invariant Systems against Signal Temporal Logic Specifications via Reachability Analysis

While reachability analysis is one of the most promising approaches for ...

Please sign up or login with your details

Forgot password? Click here to reset