8,795 research outputs found
Belief Revision with Uncertain Inputs in the Possibilistic Setting
This paper discusses belief revision under uncertain inputs in the framework
of possibility theory. Revision can be based on two possible definitions of the
conditioning operation, one based on min operator which requires a purely
ordinal scale only, and another based on product, for which a richer structure
is needed, and which is a particular case of Dempster's rule of conditioning.
Besides, revision under uncertain inputs can be understood in two different
ways depending on whether the input is viewed, or not, as a constraint to
enforce. Moreover, it is shown that M.A. Williams' transmutations, originally
defined in the setting of Spohn's functions, can be captured in this framework,
as well as Boutilier's natural revision.Comment: Appears in Proceedings of the Twelfth Conference on Uncertainty in
Artificial Intelligence (UAI1996
Default Logic in a Coherent Setting
In this talk - based on the results of a forthcoming paper (Coletti,
Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on
"Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri,
Italy, 2001) - we discuss the problem of representing default rules by means of
a suitable coherent conditional probability, defined on a family of conditional
events. An event is singled-out (in our approach) by a proposition, that is a
statement that can be either true or false; a conditional event is consequently
defined by means of two propositions and is a 3-valued entity, the third value
being (in this context) a conditional probability
Algebraic aspects and coherence conditions for conjunctions among conditional events
We deepen the study of a notion of conjunction among conditional events, introduced in previous papers in theframework of coherence. This notion of conjunction, differently from other approaches, is given in the setting ofconditional random quantities. We show that some well known properties which are satisfied by conjunctionsof unconditional events are also satisfied by conjunctions of conditional events. In particular we examine anadditive property and a decomposition formula, by also obtaining a generalized inclusion-exclusion formula. Then,by exploiting the notion of conjunction, we introduce the set of constituents generated bynconditional events.Moreover, under logical independence, we give a necessary and sufficient condition of coherence for the previsionassessments on a familyFconstituted bynconditional events and all possible conjunctions among some of them.This condition of coherence has a simple geometrical characterization in terms of a suitable convex hull. Such acharacterization amounts to the solvability of a linear system as in the case of unconditional events. Then, weillustrate the set of all coherent assessments on the familyFby a list of linear inequalities on the componentsof the prevision assessment. Finally, given a coherent assessmentMonF, we show that every possible value ofthe random vector associated withFis itself a particular coherent assessment onF
Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation
In this paper, by adopting a coherence-based probabilistic approach to
default reasoning, we focus the study on the logical operation of quasi
conjunction and the Goodman-Nguyen inclusion relation for conditional events.
We recall that quasi conjunction is a basic notion for defining consistency of
conditional knowledge bases. By deepening some results given in a previous
paper we show that, given any finite family of conditional events F and any
nonempty subset S of F, the family F p-entails the quasi conjunction C(S);
then, given any conditional event E|H, we analyze the equivalence between
p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some
nonempty subset of F. We also illustrate some alternative theorems related with
p-consistency and p-entailment. Finally, we deepen the study of the connections
between the notions of p-entailment and inclusion relation by introducing for a
pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S)
implies E|H. We show that the class K satisfies many properties; in particular
K is additive and has a greatest element which can be determined by applying a
suitable algorithm
- …