?
Dispute Resolution with OWL DL and Reasoning
Dispute resolution is an essential part of argumentation. Although there have been particular advances in computational argumentation with machine learning, we assume that explicit and deterministic techniques for dispute resolution still have significant potential. There are semantic approaches to argument representation, such as the Argument Interchange Format that supports a certain level of interoperability, but according to our knowledge, dispute resolution techniques based on semantics are not yet studied. In this research, we consider single mixed disputes through abstract argumentation frameworks and propose a method for representing such disputes in OWL DL that allows resolving them with reasoning. Additionally, we develop an algorithm for generating the OWL DL representation having argument sets and attack relations as input. The algorithm is validated with a proof of concept implementation, and the OWL DL representation – with an example of correct dispute resolution performed by reasoning over the generated ontology