A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
From MaRDI portal
Publication:1749391
DOI10.1016/j.artint.2018.01.003zbMath1444.68176OpenAlexW2788188442MaRDI QIDQ1749391
Pietro Baroni, Massimiliano Giacomin, Beishui Liao
Publication date: 16 May 2018
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.01.003
Related Items
Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Belief revision and computational argumentation: a critical comparison ⋮ On searching explanatory argumentation graphs ⋮ Complexity of abstract argumentation under a claim-centric view
Cites Work
- Unnamed Item
- A general account of argumentation with preferences
- On the input/output behavior of argumentation frameworks
- Postulates for logic-based argumentation systems
- Modeling time and valuation in structured argumentation frameworks
- An axiomatic analysis of structured argumentation with priorities
- On the evaluation of argumentation formalisms
- Argumentation in artificial intelligence
- On principle-based evaluation of extension-based argumentation semantics
- An abstract, argumentation-theoretic approach to default reasoning
- Abstract argumentation systems
- Extending abstract argumentation systems theory
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Fibring argumentation frames
- Bipolarity in argumentation graphs: towards a better understanding
- A probabilistic approach to modelling uncertain logical arguments
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Closure and Consistency In Logic-Associated Argumentation
- Collective Argumentation and Disjunctive Logic Programming
- Equivalence in logic-based argumentation
- Computing argumentation in logic programming
- Defeasible logic programming: an argumentative approach
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- Dynamics of knowledge in D<scp>e</scp>LP through Argument Theory Change
- A logic-based theory of deductive arguments
This page was built for publication: A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
