Graph theoretical properties of logic based argumentation frameworks: proofs and general results
DOI10.1007/978-3-319-78102-0_7zbMATH Open1462.68189OpenAlexW2790200272MaRDI QIDQ2029596FDOQ2029596
Authors: Bruno Yun, Madalina Croitoru, Srdjan Vesic, Pierre Bisquert 
Publication date: 3 June 2021
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01892703/file/paper.pdf
Recommendations
- Structural Properties for Deductive Argument Systems
- An investigation of argumentation framework characteristics
- Logic-based approaches to formal argumentation
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Logical limits of abstract argumentation frameworks
Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)
Cited In (7)
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Title not available (Why is that?)
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- Annotation theories over finite graphs
- Title not available (Why is that?)
- Computational properties of argument systems satisfying graph-theoretic constraints
- Using Multigraphs to Study the Interaction Between Opposition, Implication and Duality Relations in Logical Squares
This page was built for publication: Graph theoretical properties of logic based argumentation frameworks: proofs and general results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029596)
