scientific article
From MaRDI portal
Publication:3160990
zbMath1198.68234MaRDI QIDQ3160990
No author found.
Publication date: 11 October 2010
Full work available at URL: http://www.booksonline.iospress.nl/Content/View.aspx?piid=18240
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Knowledge representation (68T30) Agent technology and artificial intelligence (68T42)
Related Items
Normal and strong expansion equivalence for argumentation frameworks ⋮ Admissibility in Probabilistic Argumentation ⋮ When is argumentation deductive? ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments ⋮ A filtering-based general approach to learning rational constraints of epistemic graphs ⋮ Algorithms and complexity results for persuasive argumentation ⋮ Revision of defeasible preferences ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Modeling time and valuation in structured argumentation frameworks ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Unnamed Item ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ A formal framework for deliberated judgment ⋮ A general notion of equivalence for abstract argumentation ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
This page was built for publication:
