Metaheuristic optimization on formal argumentation[go to overview]
The task of finding extensions that fulfill certain semantics in argumentation frameworks is NP-hard. We try to apply metaheuristic optimization algorithms to find near optimal solutions to this problem in an acceptable time. Particulary we take a look at Simulated Annealing and Tabu Search, two metahueristic algorithms that have been applied to many combinatorial problems such as the TSP. We discuss the basics of formal argumentation, the idea behind Simulated Annealing and Tabu Search as well as the construction of the neighborhood and the process of finding correct extensions.
09.07.20 - 10:15
via Big Blue Button