Cbkp_redibility-limited improvement operators

Abstract:

In this paper we introduce and study cbkp_redibility-limited improvement operators. The idea is to accept the new piece of information if this information is judged cbkp_redible by the agent, so in this case a revision is performed. When the new piece of information is not cbkp_redible then it is not accepted (no revision is performed), but its plausibility is still improved in the epistemic state of the agent, similarly to what is done by improvement operators. We use a generalized definition of Darwiche and Pearl epistemic states, where to each epistemic state can be associated, in addition to the set of accepted formulas (beliefs), a set of cbkp_redible formulas. We provide a syntactic and semantic characterization of these operators.

Año de publicación:

2014

Keywords:

Fuente:

scopus