Modelling Argument Accrual in Possibilistic Defeasible Logic Programming
From MaRDI portal
Publication:3638144
DOI10.1007/978-3-642-02906-6_13zbMath1245.68186OpenAlexW1619322347WikidataQ62583414 ScholiaQ62583414MaRDI QIDQ3638144
Mauro J. Gómez Lucero, Guillermo R. Simari, Carlos Iván Chesñevar
Publication date: 2 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_13
Games involving topology, set theory, or logic (91A44) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)
Related Items (3)
Gradual semantics for weighted bipolar SETAFs ⋮ Stratified belief bases revision with argumentative inference ⋮ On searching explanatory argumentation graphs
Cites Work
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- An argumentation framework for merging conflicting knowledge bases
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Defeasible logic programming: an argumentative approach
- A logic-based theory of deductive arguments
This page was built for publication: Modelling Argument Accrual in Possibilistic Defeasible Logic Programming
