Belief revision in structured probabilistic argumentation

DOI10.1007/978-3-319-04939-7_16MaRDI QIDQ5404963zbMATH OpenOpenAlexFDO

Authors Paulo Shakarian, Gerardo Simari, Marcelo A. Falappa

Publication date 31 March 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.1475, http://hdl.handle.net/11336/12636

Mathematics Subject Classification ID

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

Abstract: In real-world applications, knowledge bases consisting of all the information at hand for a specific domain, along with the current state of affairs, are bound to contain contradictory data coming from different sources, as well as data with varying degrees of uncertainty attached. Likewise, an important aspect of the effort associated with maintaining knowledge bases is deciding what information is no longer useful; pieces of information (such as intelligence reports) may be outdated, may come from sources that have recently been discovered to be of low quality, or abundant evidence may be available that contradicts them. In this paper, we propose a probabilistic structured argumentation framework that arises from the extension of Presumptive Defeasible Logic Programming (PreDeLP) with probabilistic models, and argue that this formalism is capable of addressing the basic issues of handling contradictory and uncertain data. Then, to address the last issue, we focus on the study of non-prioritized belief revision operations over probabilistic PreDeLP programs. We propose a set of rationality postulates -- based on well-known ones developed for classical knowledge bases -- that characterize how such operations should behave, and study a class of operators along with theoretical relationships with the proposed postulates, including a representation theorem stating the equivalence between this class and the class of operators characterized by the postulates.

Recommendations

• Belief revision in structured probabilistic argumentation, model and application to cyber security
• A quantitative approach to belief revision in structured probabilistic argumentation
• Consistency-based revision of structured belief bases
• Belief Base Change Operations for Answer Set Programming
• scientific article; zbMATH DE number 1785007

Cited in

(11)

• Unifying default reasoning and belief revision in a modal framework
• Stratified belief bases revision with argumentative inference
• Consistency-based revision of structured belief bases
• A quantitative approach to belief revision in structured probabilistic argumentation
• Handling conditionals adequately in uncertain reasoning and belief revision
• Belief change and argumentation in multi-agent scenarios
• Belief revision in structured probabilistic argumentation, model and application to cyber security
• Argumentation in Multi-Agent Systems
• Rough Sets and Current Trends in Computing
• Filtered belief revision: syntax and semantics
• On efficiently estimating the probability of extensions in abstract argumentation frameworks

This page was built for publication: Belief revision in structured probabilistic argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404963)