Title: Probabilistic Default Reasoning with Conditional Constraints
Authors: Thomas Lukasiewicz
Series: Linköping Electronic Articles in Computer and Information Science
ISSN 1401-9841
Issue: Vol. 5 (2000), No. 024
URL: http://www.ep.liu.se/ea/cis/2000/024/

Abstract: We propose a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. In detail, we generalize the notions of Pearl's entailment in system Z, Lehmann's lexicographic entailment, and Geffner's conditional entailment to conditional constraints. We give some examples that show that the new notions of z-, lexicographic, and conditional entailment have similar properties like their classical counterparts. Moreover, we show that the new notions of z-, lexicographic, and conditional entailment are proper generalizations of both their classical counterparts and the classical notion of logical entailment for conditional constraints.

First posting
1999-04-06
In ETAI Newsletter and Decision and Reasoning under Uncertainty
Original publication
2000-12-21
Postscript part I -- Checksum
Checksum (old) Information about recalculation of checksum
Postscript part II -- Checksum II
Checksum II (old) Information about recalculation of checksum

This article was first posted on the Internet as specified under "First posting", and appeared on the E-press server on the date specified under "Original publication".