Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights
From MaRDI portal
Publication:2915075
DOI10.1007/978-3-642-33353-8_19zbMath1361.68229OpenAlexW36095503MaRDI QIDQ2915075
Lluís Godo, Pere Pardo, Enrico Marchioni
Publication date: 21 September 2012
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_19
Cites Work
- Unnamed Item
- Unnamed Item
- Possibilistic logic: a retrospective and prospective view
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- On the evaluation of argumentation formalisms
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Defeasible Logic is Stable
- Operators and Laws for Combining Preference Relations
- Defeasible logic programming: an argumentative approach
- Temporal defeasible reasoning