Lattice point of view for argumentation framework
From MaRDI portal
Recommendations
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
- scientific article; zbMATH DE number 1769206
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
Cites work
- A comparative test on the enumeration of extensions in abstract argumentation
- A theory of finite closure spaces based on implications
- Algorithms for decision problems in argument systems under preferred semantics
- An abstract, argumentation-theoretic approach to default reasoning
- Approximating operators and semantics for abstract dialectical frameworks
- Argumentation and answer set programming
- Argumentation in artificial intelligence
- Characteristics of multiple viewpoints in abstract argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- Design and results of the second international competition on computational models of argumentation
- Even dicycles
- Graph theoretical structures in logic programs and default theories
- scientific article; zbMATH DE number 5145289 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Lattice Theory: Foundation
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Logics in Artificial Intelligence
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On generating all maximal independent sets
- On kernels and semikernels of digraphs
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the impact of configuration on abstract argumentation automated reasoning
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Parametric properties of ideal semantics
- Permanents, Pfaffian orientations, and even directed circuits
- Splitting an Argumentation Framework
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The joy of implications, aka pure Horn formulas: mainly a survey
- Towards a general theory of decomposability in abstract argumentation
- Two basic algorithms in concept analysis
- Using arguments for making and explaining decisions
This page was built for publication: Lattice point of view for argumentation framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059223)