Graph Theoretical Properties of Logic Based Argumentation Frameworks: Proofs and General Results

Bruno Yun, Madalina Croitoru, Srdjan Vesic, Pierre Bisquert

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

2 Citations (Scopus)

Abstract

In this paper we extend our first results concerning the characterisation of the graph structure of logic based argumentation graphs with two main classes of findings. First we provide full proofs for the structural results of argumentation graphs built over Datalog± knowledge base composed of facts and negative constraints solely. Second, we also provide some structural properties for the general case of knowledge bases composed of facts, rules and negative constraints.
Original languageEnglish
Title of host publicationGraph Structures for Knowledge Representation and Reasoning
Subtitle of host publication5th International Workshop, GKR 2017, Melbourne, VIC, Australia, August 21, 2017, Revised Selected Papers
EditorsM Croitoru , P Marquis , S Rudolph , G Stapleton
PublisherSpringer
Pages118-138
Number of pages21
ISBN (Electronic)978-3-319-78102-0
ISBN (Print)978-3-319-78101-3
DOIs
Publication statusPublished - 2017
EventInternational Workshop on Graph Structures for Knowledge Representation and Reasoning - Melbourne, Australia
Duration: 21 Aug 201721 Aug 2017

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10775
ISSN (Print)0302-9743

Conference

ConferenceInternational Workshop on Graph Structures for Knowledge Representation and Reasoning
Abbreviated titleGKR 2017
Country/TerritoryAustralia
CityMelbourne
Period21/08/1721/08/17

Fingerprint

Dive into the research topics of 'Graph Theoretical Properties of Logic Based Argumentation Frameworks: Proofs and General Results'. Together they form a unique fingerprint.

Cite this