Logical deduction using the local computation framework

From MaRDI portal





Computation in a number of uncertainty formalisms has recently been revolutionized by the notion of local computation. \textit{S. L. Lauritzen} and \textit{D. J. Spiegelhalter} [J. R. Stat. Soc., Ser. B 50, No. 2, 157-224 (1988; Zbl 0684.68106)] and \textit{J. Pearl} [Probabilistic reasoning in intelligent systems: networks of plausible inference (Morgan Kaufmann, San Mateo) (1989; Zbl 0746.68089)] showed how Bayesian probability could be efficiently propagated in a network of variables; this has already led to sizeable successful applications, as well as a large body of literature on these Bayesian networks and related issues. In the late `Eighties, \textit{G. Shafer} and \textit{P. Shenoy} [``Axioms for probability and belief-function propagation, in: G. Shafer et al. (eds.), Readings in uncertain reasoning (Morgan Kaufmann, San Mateo), 575-610 (1990; Zbl 0805.68121)] abstracted these ideas, leading to their Local Computation framework. Remarkably, the propagation algorithms of this general framework give rise to efficient computation in a number of spheres of reasoning. This paper shows how the framework can be used for the computation of logical deduction, by embedding model structures in the framework; this is described in section 3. This work can be applied to many of the formalisms used to represent and reason with common sense including predicate calculus, modal logics, possibilistic logics, probabilistic logics and nonmonotonic logics. For the entire collection see [Zbl 0916.00019].











This page was built for publication: Logical deduction using the local computation framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263004)