What Can Approximation Fixpoint Theory Do For (Abstract) Argumentation?

Hannes StrassHannes Strass

Slides

Hannes Strass
What Can Approximation Fixpoint Theory Do For (Abstract) Argumentation?
Tutorial at SSA, September 2024

Details
Bibtex

KurzfassungAbstract
Approximation Fixpoint Theory is an algebraic framework for studying semantics of knowledge representation formalisms. It builds upon the idea that knowledge bases can be associated with operators such that fixpoints of the operator correspond to models of the knowledge base. This is an established technique in logic programming, and we will show how it can be fruitfully applied to (abstract) argumentation.
Forschungsgruppe:Research Group: Computational LogicComputational Logic

@misc{S2024,
  author = {Hannes Strass},
  title  = {What Can Approximation Fixpoint Theory Do For (Abstract)
            Argumentation?},
  year   = {2024},
  month  = {September}
}