On Császár's condition in nonmonotonic reasoning.

摘要: Csaszar’s condition is a well-known property introduced about 50 years ago in the axiomatic theory of conditional probability. In recent such has been reconsidered by some authors, who have studied its role coherence-based approach to this paper we consider probabilistic entailment knowledge base another one. We represent Loop rule generalized way and, using condition, give simple interpretation it. Then, exploiting rules Cautious Monotonicity and Cut, obtain related results on p-entailment associated with rule. also determine best probability bounds for quasi-conjunction two events semantics QAND Finally, reconsider our setting objects.