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.

Original languageEnglish (US)
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages47-74
Number of pages28
Edition9783319737874
DOIs
StatePublished - Jan 1 2018

Publication series

NameSpringerBriefs in Computer Science
Number9783319737874
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

Fingerprint

Mathematical operators
Artificial intelligence
Specifications
Engineers

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Nunes, E., Shakarian, P., Simari, G. I., & Ruef, A. (2018). Belief revision in DeLP3E. In SpringerBriefs in Computer Science (9783319737874 ed., pp. 47-74). (SpringerBriefs in Computer Science; No. 9783319737874). Springer. https://doi.org/10.1007/978-3-319-73788-1_4

Belief revision in DeLP3E. / Nunes, Eric; Shakarian, Paulo; Simari, Gerardo I.; Ruef, Andrew.

SpringerBriefs in Computer Science. 9783319737874. ed. Springer, 2018. p. 47-74 (SpringerBriefs in Computer Science; No. 9783319737874).

Research output: Chapter in Book/Report/Conference proceedingChapter

Nunes, E, Shakarian, P, Simari, GI & Ruef, A 2018, Belief revision in DeLP3E. in SpringerBriefs in Computer Science. 9783319737874 edn, SpringerBriefs in Computer Science, no. 9783319737874, Springer, pp. 47-74. https://doi.org/10.1007/978-3-319-73788-1_4
Nunes E, Shakarian P, Simari GI, Ruef A. Belief revision in DeLP3E. In SpringerBriefs in Computer Science. 9783319737874 ed. Springer. 2018. p. 47-74. (SpringerBriefs in Computer Science; 9783319737874). https://doi.org/10.1007/978-3-319-73788-1_4
Nunes, Eric ; Shakarian, Paulo ; Simari, Gerardo I. ; Ruef, Andrew. / Belief revision in DeLP3E. SpringerBriefs in Computer Science. 9783319737874. ed. Springer, 2018. pp. 47-74 (SpringerBriefs in Computer Science; 9783319737874).
@inbook{d9fe57177a54402cbcdc3f6583006749,
title = "Belief revision in DeLP3E",
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.",
author = "Eric Nunes and Paulo Shakarian and Simari, {Gerardo I.} and Andrew Ruef",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-73788-1_4",
language = "English (US)",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319737874",
pages = "47--74",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319737874",

}

TY - CHAP

T1 - Belief revision in DeLP3E

AU - Nunes, Eric

AU - Shakarian, Paulo

AU - Simari, Gerardo I.

AU - Ruef, Andrew

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85044933910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044933910&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-73788-1_4

DO - 10.1007/978-3-319-73788-1_4

M3 - Chapter

AN - SCOPUS:85044933910

T3 - SpringerBriefs in Computer Science

SP - 47

EP - 74

BT - SpringerBriefs in Computer Science

PB - Springer

ER -