KR2025Proceedings of the 22nd International Conference on Principles of Knowledge Representation and ReasoningProceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning

Melbourne, Australia. November 11-17, 2025.

Edited by
  1. Magdalena Ortiz
  2. Renata Wassermann
  3. Torsten Schaub

ISSN: 2334-1033
ISBN: 978-1-956792-08-9

Sponsored by
Published by

Copyright © 2025 International Joint Conferences on Artificial Intelligence Organization

Extending Abstract Argumentation Frameworks with Knowledge Bases

  1. Gianvincenzo Alfano(D.I.M.E.S Department, University of Calabria)
  2. Sergio Greco(D.I.M.E.S Department, University of Calabria)
  3. Cristian Molinaro(D.I.M.E.S Department, University of Calabria)
  4. Francesco Parisi(D.I.M.E.S Department, University of Calabria)
  5. Irina Trubitsyna(University of Calabria, DIMES)
PDF
BibTeX
https://doi.org/10.24963/kr.2025/3

Keywords

  1. Computational Complexity
  2. Abstract Argumentation
  3. Knowledge Bases
  4. Description Logic

Abstract

Dung's abstract Argumentation Framework (AF) has been extended in several directions to make knowledge representation and reasoning more intuitive and expressive.

In this paper, we present the Knowledge-based Argumentation Framework (KAF), an extension of AF with a Knowledge Base (KB) expressed in DL-Lite, which includes concept and role instances describing the topology of an AF, besides additional knowledge on the domain.

The KAF semantics is given by a set of KAF extensions, each consisting of an extension of the underlying AF together with a ``pertinent'' subset of the original KB, which is obtained by discarding assertions referring to arguments that have been ruled out in the AF extension.

Then, the framework is further expanded into the Constrained KAF (CKAF), where a set of restricted relational calculus formulae is used for reasoning over `feasible' subframeworks that satisfy the formulae and minimally differ from the original framework.

We thoroughly investigate the computational complexity of classical reasoning problems under popular argumentation semantics, and show that well-known AF-based frameworks are special cases of CKAF.