Introducing equational semantics for argumentation networks
From MaRDI portal
Recommendations
- Equilibrium states in numerical argumentation networks
- Logical foundations for bipolar and tripolar argumentation networks: preliminary results
- An equational approach to logic programming
- An equational approach to the merging of argumentation networks
- Modal provability foundations for argumentation networks
Cites work
- A logical account of formal argumentation
- Annotation theories over finite graphs
- Fibring argumentation frames
- Introducing equational semantics for argumentation networks
- Mechanizing Mathematical Reasoning
- Modal provability foundations for argumentation networks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Weighted argument systems: basic definitions, algorithms, and complexity results
Cited in
(9)- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
- Evaluation of argument strength in attack graphs: foundations and semantics
- Logical foundations for bipolar and tripolar argumentation networks: preliminary results
- An equational approach to logic programming
- A numerical approach to the merging of argumentation networks
- Introducing equational semantics for argumentation networks
- Editorial: Weighted logics for artificial intelligence -- an introductory discussion
- Mechanizing Mathematical Reasoning
- Equilibrium states in numerical argumentation networks
This page was built for publication: Introducing equational semantics for argumentation networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011932)
