Toward a more efficient generation of structured argumentation graphs

DOI10.3233/978-1-61499-906-5-205MaRDI QIDQ5215686zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

existential ruleslogic based argumentation graphs

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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
• scientific article; zbMATH DE number 6747882 (Why is no real title available?)
• Graph-classes of argumentation frameworks with collective attacks
• scientific article; zbMATH DE number 1537943 (Why is no real title available?)

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)