Implementing the Decomposition Schema for Abstract Dialectical Frameworks

From International Center for Computational Logic
Toggle side column

Implementing the Decomposition Schema for Abstract Dialectical Frameworks

Available as topic for a project thesis
Abstract Dialecital Frameworks (ADFs) are a generalization of Dungs AFs. As the computational complexity of the dedicated reasoning problems is in general higher than for AFs, a common approach is to decompose the framework into smaller subproblems and compose the solutions of the subproblems to an overall solution. The task of the project is to implement a system which computes the models of various semantics based on a given decomposition schema for ADFs.