Belief revision in structured probabilistic argumentation, model and application to cyber security
From MaRDI portal
Publication:524938
DOI10.1007/s10472-015-9483-5zbMath1405.68367OpenAlexW2787097606MaRDI QIDQ524938
Simon Parsons, Marcelo A. Falappa, Gerardo I. Simari, Paulo Shakarian, Ashkan Aleali, Damon Paulo, Geoffrey Moores
Publication date: 27 April 2017
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-9483-5
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
A quantitative approach to belief revision in structured probabilistic argumentation ⋮ Argument strength in probabilistic argumentation using confirmation theory ⋮ Argument strength in probabilistic argumentation based on defeasible rules ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ Delegated updates in epistemic graphs for opponent modelling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general account of argumentation with preferences
- Prioritized and non-prioritized multiple change on belief bases
- Focused most probable world computations in probabilistic logic programs
- Weighted argument systems: basic definitions, algorithms, and complexity results
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A mathematical treatment of defeasible reasoning and its implementation.
- Probabilistic logic
- An abstract, argumentation-theoretic approach to default reasoning
- 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
