Graph theoretical properties of logic based argumentation frameworks: proofs and general results
From MaRDI portal
Publication:2029596
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
Cited in
(11)- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Toward a more efficient generation of structured argumentation graphs
- Using Multigraphs to Study the Interaction Between Opposition, Implication and Duality Relations in Logical Squares
- scientific article; zbMATH DE number 6747882 (Why is no real title available?)
- scientific article; zbMATH DE number 1210779 (Why is no real title available?)
- Encoding argument graphs in logic
- Computational properties of argument systems satisfying graph-theoretic constraints
- Gradual semantics for logic-based bipolar graphs using t-(co)norms
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- A propositional logical encoding of enriched interactions in abstract argumentation graphs
- Annotation theories over finite graphs
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)
