A quantitative approach to belief revision in structured probabilistic argumentation

DOI10.1007/s10472-015-9476-4zbMath1356.68224OpenAlexW2175917793MaRDI QIDQ287765

Paulo Shakarian, Gerardo I. Simari, Marcelo A. Falappa

Publication date: 23 May 2016

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-015-9476-4

zbMATH Keywords

belief revisionreasoning under probabilistic uncertaintystructured argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic programming (68N17)

Related Items (3)

Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ An extension-based approach to belief revision in abstract argumentation ⋮ An approach to characterize graded entailment of arguments through a label-based framework

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inconsistency measures for probabilistic logics
• A series of revisions of David Poole's specificity
• Belief revision in structured probabilistic argumentation, model and application to cyber security
• A logic programming framework for possibilistic argumentation: Formalization and logical properties
• A mathematical treatment of defeasible reasoning and its implementation.
• Probabilistic logic
• On the status of the postulate of recovery in the logic of theory change
• The independent choice logic for modelling multiple agents under uncertainty
• A logic for reasoning about probabilities
• Explanations, belief revision and defeasible reasoning.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
• A probabilistic approach to modelling uncertain logical arguments
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Markov logic networks
• On the Complexity of Probabilistic Abstract Argumentation Frameworks
• Semi-revision
• Computing Generalized Specificity
• On the logic of theory change: Partial meet contraction and revision functions
• Kernel contraction
• Defeasible logic programming: an argumentative approach
• Belief Revision in Structured Probabilistic Argumentation

This page was built for publication: A quantitative approach to belief revision in structured probabilistic argumentation