Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs

View through CrossRef
In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probabilistic formulae), through the technique of variable forgetting. We first extend the traditional forgetting method to forget a conditional event in PLPs. We then propose two revision operators to revise a PLP based on our forgetting method. By revision through forgetting, the irrelevant knowledge in the original PLP is retained according to the minimal change principle. We prove that our revision operators satisfy most of the postulates for probabilistic belief revision. A main advantage of our revision operators is that a new PLP is explicitly obtained after revision, since our revision operator performs forgetting a conditional event at the syntax level.
Title: Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Description:
In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probabilistic formulae), through the technique of variable forgetting.
We first extend the traditional forgetting method to forget a conditional event in PLPs.
We then propose two revision operators to revise a PLP based on our forgetting method.
By revision through forgetting, the irrelevant knowledge in the original PLP is retained according to the minimal change principle.
We prove that our revision operators satisfy most of the postulates for probabilistic belief revision.
A main advantage of our revision operators is that a new PLP is explicitly obtained after revision, since our revision operator performs forgetting a conditional event at the syntax level.

Related Results

Conditionals, Truth, and Assertion
Conditionals, Truth, and Assertion
AbstractThis chapter argues that the conditional probability of the consequent given the antecedent is crucial to understanding indicative conditionals. However, unlike Jackson, it...
Subjunctive Conditionals
Subjunctive Conditionals
A proposal for a compositional semantics for subjunctive (or would) conditionals in English. In this book, Michela Ippolito proposes a compositional semantics for su...
Inventory and pricing management in probabilistic selling
Inventory and pricing management in probabilistic selling
Context: Probabilistic selling is the strategy that the seller creates an additional probabilistic product using existing products. The exact information is unknown to customers u...
A Semantic Account of Iterated Belief Revision in the Situation Calculus
A Semantic Account of Iterated Belief Revision in the Situation Calculus
Recently Shapiro et al. explored the notion of iterated belief revision within Reiter's version of the situation calculus. In particular, they consider a notion of belief defined a...
Conditional Constructions in Yemsa
Conditional Constructions in Yemsa
Introduction. The main objective of this study is to produce a comprehensive description of Yemsa conditional constructions. The existing studies do not describe conditional clause...
Some Functions of Collective Forgetting
Some Functions of Collective Forgetting
Coerced forgetting — forgetting as repressive erasure — has been a hallmark of many of the totalitarian regimes of the 20th century. However, the act of forgetting is not always ne...
Tableau-based Forgetting in 𝒜ℒ𝒞 Ontologies
Tableau-based Forgetting in 𝒜ℒ𝒞 Ontologies
In this paper, we propose two new approaches to forgetting for 𝒜ℒ𝒞 based on the well-known tableau algorithm. The first approach computes the result of f...

Back to Top