Decomposing Constraint Networks for Calculating c-Representations

It is well-known from probability theory that network-based methods like Bayesian networks constitute remarkable frameworks for efficient probabilistic reasoning. In this paper, we focus on qualitative default reasoning based on Spohn’s ranking functions for which network-based methods have not yet been studied satisfactorily. With constraint networks, we develop a framework for iterative calculations of c-representations, a family of ranking models of conditional belief bases which show outstanding properties from a commonsense and formal point of view, that are characterized by assigning possible worlds a degree of implausibility via penalizing the falsification of conditionals. Constraint networks unveil the dependencies among these penalty points (and hence among the conditionals) and make it possible to compute the penalty points locally on so-called safe sub-bases. As an application of our framework, we show that skeptical c-inferences can be drawn locally from safe sub-bases without losing validity.

Authors

• Marco Wilhelm
• Gabriele Kern-Isberner

Keywords

• KRR: Common-Sense Reasoning
• KRR: Nonmonotonic Reasoning
• KRR: Preferences
• KRR: Qualitative Reasoning
• KRR: Reasoning with Beliefs