Belief revision in structured probabilistic argumentation

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages324-343
Number of pages20
Volume8367 LNCS
DOIs
StatePublished - 2014
Externally publishedYes
Event8th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2014 - Bordeaux, France
Duration: Mar 3 2014Mar 7 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8367 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2014
CountryFrance
CityBordeaux
Period3/3/143/7/14

Fingerprint

Belief Revision
Logic programming
Argumentation
Postulate
Knowledge Base
Logic Programming
Uncertain Data
Representation Theorem
Rationality
Operator
Real-world Applications
Probabilistic Model
Equivalence
Uncertainty
Class
Statistical Models

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Shakarian, P., Simari, G. I., & Falappa, M. A. (2014). Belief revision in structured probabilistic argumentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8367 LNCS, pp. 324-343). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8367 LNCS). https://doi.org/10.1007/978-3-319-04939-7_16

Belief revision in structured probabilistic argumentation. / Shakarian, Paulo; Simari, Gerardo I.; Falappa, Marcelo A.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8367 LNCS 2014. p. 324-343 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8367 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakarian, P, Simari, GI & Falappa, MA 2014, Belief revision in structured probabilistic argumentation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8367 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8367 LNCS, pp. 324-343, 8th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2014, Bordeaux, France, 3/3/14. https://doi.org/10.1007/978-3-319-04939-7_16
Shakarian P, Simari GI, Falappa MA. Belief revision in structured probabilistic argumentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8367 LNCS. 2014. p. 324-343. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-04939-7_16
Shakarian, Paulo ; Simari, Gerardo I. ; Falappa, Marcelo A. / Belief revision in structured probabilistic argumentation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8367 LNCS 2014. pp. 324-343 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c2fdaf648ea843dda2380395e5a92949,
title = "Belief revision in structured probabilistic argumentation",
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.",
author = "Paulo Shakarian and Simari, {Gerardo I.} and Falappa, {Marcelo A.}",
year = "2014",
doi = "10.1007/978-3-319-04939-7_16",
language = "English (US)",
isbn = "9783319049380",
volume = "8367 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "324--343",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Belief revision in structured probabilistic argumentation

AU - Shakarian, Paulo

AU - Simari, Gerardo I.

AU - Falappa, Marcelo A.

PY - 2014

Y1 - 2014

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

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

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

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

U2 - 10.1007/978-3-319-04939-7_16

DO - 10.1007/978-3-319-04939-7_16

M3 - Conference contribution

AN - SCOPUS:84898061138

SN - 9783319049380

VL - 8367 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 324

EP - 343

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -