LiEP CIS-2000-024: Probabilistic Default Reasoning with Conditional Constraints.

Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science

The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

Probabilistic Default Reasoning with Conditional Constraints.

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): nr 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.
Keywords:

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.

Keywords:

First posting 1999-04-06	In ETAI Newsletter and Decision and Reasoning under Uncertainty
Intended publication 1999-12-21	Postscript part I -- Checksum Postscript part II -- Checksum II
Info from authors
Third-party information

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se