Computing Generalized Specificity
From MaRDI portal
Publication:3647205
DOI10.3166/jancl.13.87-113zbMath1185.68679OpenAlexW2075805052WikidataQ62583426 ScholiaQ62583426MaRDI QIDQ3647205
Frieder Stolzenburg, Guillermo R. Simari, Alejandro Javier García, Carlos Iván Chesñevar
Publication date: 30 November 2009
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.13.87-113
Related Items (12)
A quantitative approach to belief revision in structured probabilistic argumentation ⋮ A logic programming framework for possibilistic argumentation: Formalization and logical properties ⋮ Rethinking specificity in defeasible reasoning and its effect in argument reinstatement ⋮ Integrated preference argumentation and applications in consumer behaviour analyses ⋮ On the Acceptability of Incompatible Arguments ⋮ Dialectical Explanations in Defeasible Argumentation ⋮ DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ Modeling time and valuation in structured argumentation frameworks ⋮ A series of revisions of David Poole's specificity ⋮ Belief revision in structured probabilistic argumentation, model and application to cyber security ⋮ Preference-based argumentation: arguments supporting multiple values
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical treatment of defeasible reasoning and its implementation.
- Abstract argumentation systems
- Relating defeasible and normal logic programming through transformation properties.
- Reasoning with logic programming
- Argument-based extended logic programming with defeasible priorities
- Defeasible logic versus Logic Programming without Negation as Failure
This page was built for publication: Computing Generalized Specificity
