Parameterized splitting: a simple modification-based approach
From MaRDI portal
Publication:2900508
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Depth-First Search and Linear Graph Algorithms
- Dynamics of argumentation systems: a division-based method
- Modularity aspects of disjunctive stable models
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Splitting an Argumentation Framework
Cited in
(14)- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- A general notion of equivalence for abstract argumentation
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- On the input/output behavior of argumentation frameworks
- RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks
- Logic Programming
- Complexity-sensitive decision procedures for abstract argumentation
- Constrained derivation in assumption-based argumentation
- How to split a logic program
- Normal and strong expansion equivalence for argumentation frameworks
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Methods for solving reasoning problems in abstract argumentation -- a survey
- I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
This page was built for publication: Parameterized splitting: a simple modification-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900508)