On the preferred extensions of argumentation frameworks: bijections with naive sets

DOI10.1016/j.ipl.2022.106354OpenAlexW4313462278MaRDI QIDQ2681398

Mohammed Said Radjef, Simon Vilmin, Mohammed Elaroussi, Lhouari Nourine

Publication date: 3 February 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.05506

zbMATH Keywords

computational complexitycombinatorial problemsenumeration algorithmsargumentation frameworkspreferred extensions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Lattice point of view for argumentation framework

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The joy of implications, aka pure Horn formulas: mainly a survey
• Algorithms for \(k\)-meet-semidistributive lattices
• Graph theoretical structures in logic programs and default theories
• Using arguments for making and explaining decisions
• Characteristics of multiple viewpoints in abstract argumentation
• Argumentation in artificial intelligence
• Computational properties of argument systems satisfying graph-theoretic constraints
• On generating all maximal independent sets
• An abstract, argumentation-theoretic approach to default reasoning
• On the impact of configuration on abstract argumentation automated reasoning
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Realizability of three-valued semantics for abstract dialectical frameworks
• Design and results of the second international competition on computational models of argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• Lattice Theory: Foundation
• Two Basic Algorithms in Concept Analysis
• The Factorization and Representation of Lattices
• Initial sets in abstract argumentation frameworks
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses

This page was built for publication: On the preferred extensions of argumentation frameworks: bijections with naive sets