๐ฎ
๐ฎ
The Ethereal
Formal Verification of Debates in Argumentation Theory
December 12, 2019 ยท The Ethereal ยท ๐ ACM Symposium on Applied Computing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ria Jha, Francesco Belardinelli, Francesca Toni
arXiv ID
1912.05828
Category
cs.LO: Logic in CS
Cross-listed
cs.AI
Citations
2
Venue
ACM Symposium on Applied Computing
Last Checked
5 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal