DYNAMIC BACKTRACKING FOR ABSTRACT ARGUMENTATION SYSTEMS

Abstract

Abstract Argumentation Frameworks (AFs) are a major formalism for practical reasoning, to be used in non-monotonical reasoning of intelligent agents. The paper presents some of the latest researches in the field of efficient computation for different semantics of abstract argumentation systems. An algorithm with backtracking with look-ahead and different heuristics is taken as a basis, to be further developed and to experiment new backtracking -based optimizations in the field of AF, and an adaptation of dynamic backtracking for the same field is shaped for further experiments and improvements.