A logic programming framework for possibilistic argumentation: Formalization and logical properties

DOI10.1016/j.fss.2007.12.013zbMath1187.68601OpenAlexW2162918666WikidataQ61918772 ScholiaQ61918772MaRDI QIDQ835125

Teresa Alsinet, Guillermo R. Simari, Carlos Iván Chesñevar, Lluís Godo

Publication date: 28 August 2009

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10261/159961

zbMATH Keywords

intelligent systemspossibilistic logicdefeasible argumentationvague knowledge

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic programming (68N17)

Related Items

A quantitative approach to belief revision in structured probabilistic argumentation ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights ⋮ An approach to decision making based on dynamic argumentation systems ⋮ Inference procedures and engine for probabilistic argumentation ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ A labeled argumentation framework ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ Belief revision in structured probabilistic argumentation, model and application to cyber security ⋮ Modelling Argument Accrual in Possibilistic Defeasible Logic Programming ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Possibilistic nested logic programs and strong equivalence ⋮ An approach to improve argumentation-based epistemic planning with contextual preferences ⋮ The possibilistic Horn non-clausal knowledge bases ⋮ Probabilistic qualification of attack in abstract argumentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical treatment of defeasible reasoning and its implementation.
• On the evaluation of argumentation formalisms
• Abstract argumentation systems
• The possibilistic handling of irrelevance in exception-tolerant reasoning
• Relating defeasible and normal logic programming through transformation properties.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Inferring from inconsistency in preference-based argumentation frameworks
• Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
• Fuzzy sets in a approximate reasoning. I: Inference with possibility distributions
• Argument-based extended logic programming with defeasible priorities
• Computing Generalized Specificity
• Agents that reason and negotiate by arguing
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• Probabilistic argumentation systems: a new perspective on the dempster-shafer theory
• Defeasible logic programming: an argumentative approach
• Argumentation in Multi-Agent Systems
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Logic Programming and Nonmonotonic Reasoning
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A logic-based theory of deductive arguments
• Defeasible reasoning with variable degrees of justification