Toward a more efficient generation of structured argumentation graphs
From MaRDI portal
Publication:5215686
DOI10.3233/978-1-61499-906-5-205zbMATH Open1430.68324OpenAlexW2893952115MaRDI QIDQ5215686FDOQ5215686
Authors: Bruno Yun, Srdjan Vesic, Madalina Croitoru 
Publication date: 12 February 2020
Full work available at URL: http://aura.abdn.ac.uk/bitstream/2164/13514/1/Yun_etal_FAIA305_VOR.pdf
Recommendations
- Graph-based dispute derivations in assumption-based argumentation
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Graph theoretical properties of logic based argumentation frameworks: proofs and general results
- An Algorithm for Generating Arguments in Classical Predicate Logic
- Logic-based argumentation with existential rules
Cited In (8)
- An approach to generating arguments over DL-Lite ontologies
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Revisiting approximate reasoning based on grounded semantics
- Algorithms for generating arguments and counterarguments in propositional logic
- Expressiveness of SETAFs and support-free ADFs under 3-valued semantics
- Title not available (Why is that?)
- Graph-classes of argumentation frameworks with collective attacks
- Title not available (Why is that?)
This page was built for publication: Toward a more efficient generation of structured argumentation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215686)
