Abstract
Any artificial intelligence tool designed for cyber-attribution must deal with information coming from different sources that invariably leads to incompleteness, overspecification, or inherently uncertain content. The presence of these varying levels of uncertainty doesn’t mean that the information is worthless—rather, these are hurdles that the knowledge engineer must learn to work with. In this chapter, we continue developing the DeLP3E model introduced in the previous chapter, focusing now on the problem of belief revision in DeLP3E. We first propose a non-prioritized class of revision operators called AFO (Annotation Function-based Operators); then, we go on to argue that in some cases it may be desirable to define revision operators that take quantitative aspects into account (such as how the probabilities of certain literals or formulas of interest change after the revision takes place). As a result, we propose the QAFO (Quantitative Annotation Function-based Operators) class of operators, a subclass of AFO, and study the complexity of several problems related to their specification and application in revising knowledge bases. Finally, we present an algorithm for computing the probability that a literal is warranted in a DeLP3E knowledge base, and discuss how it could be applied towards implementing QAFO-style operators that compute approximations rather than exact operations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
That is, af ′(x) = af(x) for all x ∈dom(af), and dom(af ′) = dom(af) ∪{f}.
- 2.
Note that this definition can easily be extended to deal with probability intervals as well (i.e., using both nec and poss); here, for simplicity of presentation, we adopt this definition in order to work with point probabilities.
References
M. Capobianco, C. I. Chesñevar, and G. R. Simari. Argumentation and the dynamics of warranted beliefs in changing environments. Journal on Autonomous Agents and Multiagent Systems, 11:127–151, Sept. 2005.
L. A. Cecchi and G. R. Simari. El marcado de un árbol dialéctico en DeLP es PSPACE-completo. In Proceedings of Congreso Argentino de Ciencias de la Computación (CACIC), 2011.
V. Chvátal. Linear Programming. W.H.Freeman, New York, 1983.
R. Fagin, J. Y. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1/2):78–128, 1990.
M. A. Falappa, G. Kern-Isberner, M. Reis, and G. R. Simari. Prioritized and non-prioritized multiple change on belief bases. Journal of Philosophical Logic, 41(1):77–113, 2012.
A. J. García and G. R. Simari. Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming, 4(1–2):95–138, 2004.
S. Hansson. Semi-revision. Journal of Applied Non-Classical Logics, 7(1–2):151–175, 1997.
N. J. Nilsson. Probabilistic logic. Artificial Intelligence, 28(1):71–87, 1986.
P. Shakarian, G. I. Simari, G. Moores, S. Parsons, and M. A. Falappa. An argumentation-based framework to address the attribution problem in cyber-warfare. In Proceedings of the ASE International Conference on Cyber Security, 2014.
P. Shakarian, G. I. Simari, G. Moores, D. Paulo, S. Parsons, M. A. Falappa, and A. Aleali. Belief revision in structured probabilistic argumentation: Model and application to cyber security. Annals of Mathematics and Artificial Intelligence, 78(3–4):259–301, 2016.
G. I. Simari, P. Shakarian, and M. A. Falappa. A quantitative approach to belief revision in structured probabilistic argumentation. Annals of Mathematics and Artificial Intelligence, 76(3–4):375–408, 2016.
S. Toda. On the computational power of PP and ⊕P. In Proc. of FOCS, pages 514–519, 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 The Author(s)
About this chapter
Cite this chapter
Nunes, E., Shakarian, P., Simari, G.I., Ruef, A. (2018). Belief Revision in DeLP3E . In: Artificial Intelligence Tools for Cyber Attribution. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-73788-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-73788-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73787-4
Online ISBN: 978-3-319-73788-1
eBook Packages: Computer ScienceComputer Science (R0)