## Anytime Deduction for Probabilistic Logic (1994)

Venue: | Artif. Intell |

Citations: | 62 - 1 self |

### BibTeX

@ARTICLE{Frisch94anytimededuction,

author = {Alan Frisch and Peter Haddawy},

title = {Anytime Deduction for Probabilistic Logic},

journal = {Artif. Intell},

year = {1994},

volume = {69},

pages = {93--122}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper proposes and investigates an approach to deduction in probabilistic logic, using as its medium a language that generalizes the propositional version of Nilsson's probabilistic logic by incorporating conditional probabilities. Unlike many other approaches to deduction in probabilistic logic, this approach is based on inference rules and therefore can produce proofs to explain how conclusions are drawn. We show how these rules can be incorporated into an anytime deduction procedure that proceeds by computing increasingly narrow probability intervals that contain the tightest entailed probability interval. Since the procedure can be stopped at any time to yield partial information concerning the probability range of any entailed sentence, one can make a tradeoff between precision and computation time. The deduction method presented here contrasts with other methods whose ability to perform logical reasoning is either limited or requires finding all truth assignments consistent ...

### Citations

7634 |
Probabilistic Reasoning in Intelligent Systems
- Pearl
- 1988
(Show Context)
Citation Context ...on of rule (xx) can be found in a paper by Dubois [11]. Rule (xxv) for introducing conjunction is also presented by Ursic [34]. Rules (xxiii) and (xxiv) accomplish a transformation similar to Pearl's =-=[29]-=- clustering technique for removing loops in Bayes nets. Rules (viii) and (ix) are respectively the the generalized Bayes' rule 10 and the rule of quantified syllogism, presented by Amarger, et.al. [2]... |

523 |
An analysis of time-dependent planning
- Dean, Boddy
- 1988
(Show Context)
Citation Context ... the procedure "anytime deduction" here because our principal focus is the ability to provide partial information at any time, regardless of whether convergence is ultimately attained. Dean =-=and Boddy [9]-=- coined the term anytime algorithm in the context of work that explored issues in time-dependent planning. They defined an anytime algorithm as one that i) lends itself to preemptive scheduling techni... |

440 |
Probabilistic logic
- Nilsson
- 1986
(Show Context)
Citation Context ... and probability-based approaches to knowledge representation. Recently AI researchers have attempted to bridge this rift by developing formal languages integrating probability with first-order logic =-=[27; 3; 12; 17; 18]-=-. Interest in this problem as a research topic for AI was sparked by Nilsson's [27] paper on probabilistic logic. 1 Probabilistic logic is appealing in many ways. Its well-defined model theory clarifi... |

282 | An analysis of first-order logics of probability
- Halpern
- 1990
(Show Context)
Citation Context ... and probability-based approaches to knowledge representation. Recently AI researchers have attempted to bridge this rift by developing formal languages integrating probability with first-order logic =-=[27; 3; 12; 17; 18]-=-. Interest in this problem as a research topic for AI was sparked by Nilsson's [27] paper on probabilistic logic. 1 Probabilistic logic is appealing in many ways. Its well-defined model theory clarifi... |

263 |
Representing and reasoning with probabilistic knowledge
- Bacchus
- 1990
(Show Context)
Citation Context ... and probability-based approaches to knowledge representation. Recently AI researchers have attempted to bridge this rift by developing formal languages integrating probability with first-order logic =-=[27; 3; 12; 17; 18]-=-. Interest in this problem as a research topic for AI was sparked by Nilsson's [27] paper on probabilistic logic. 1 Probabilistic logic is appealing in many ways. Its well-defined model theory clarifi... |

235 | N.: A logic for reasoning about probabilities
- Fagin, Halpern, et al.
- 1990
(Show Context)
Citation Context |

133 | Reasoning under varying and uncertain resource constraints
- Horvitz
- 1988
(Show Context)
Citation Context ...y [33; 8; 6; 36] and real-time systems [22; 21; 7]. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz =-=[19]-=- presented a general decisiontheoretic framework for reasoning about the optimality of computational methods operating under constraints on time and other resources. He contrasts partial strategies wi... |

127 |
Scheduling periodic jobs that allows imprecise results
- Chung, Liu, et al.
- 1990
(Show Context)
Citation Context ...AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory [33; 8; 6; 36] and real-time systems =-=[22; 21; 7]-=-. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a general decisiontheoretic framewo... |

119 | Anytime synthetic projection: Maximizing the probability of goal satisfaction
- Drummond, Bresina
- 1990
(Show Context)
Citation Context ...t we have some notion of the marginal improvement in an answer as a function of a marginal increase in computation time. Since then researchers have presented anytime algorithms for other AI problems =-=[10; 37]-=-. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory [33; 8; 6; 36] and real-time systems [22; 21; 7]. In the ... |

87 | Reflection and action under scarce resources: Theoretical principles and empirical study
- Horvitz, Cooper, et al.
- 1989
(Show Context)
Citation Context ...lans, allowing a planning system to adapt flexibly under time constraints. Guidance in applying anytime deduction procedures to decision problems could be provided by Horvitz, Cooper, and Heckerman's =-=[20]-=- framework for reasoning about actions under time constraints. Their work explores how to optimally control methods of computing probability bounds in Bayes nets, showing how knowledge of the rate of ... |

61 | A semantical framework for supporting subjective and conditional probabilities in deductive databases
- NG, SUBRAHMANIAN
- 1993
(Show Context)
Citation Context ...ocedure. They further extend inferno's network approach with rules for introducing new nodes. These new nodes are limited to conjunctions and disjunctions of nodes in the network. Ng and Subrahmanian =-=[25; 24]-=- formulate a sound and complete inference system based on SLD deduction (as used in logic programming) for a class of probabilistic entailment problems that is almost totally disjoint from those addre... |

51 |
Approximate Processing in Real-Time Problem Solving
- Lesser, Pavlin, et al.
- 1988
(Show Context)
Citation Context ...AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory [33; 8; 6; 36] and real-time systems =-=[22; 21; 7]-=-. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a general decisiontheoretic framewo... |

51 |
Scheduling Real-Time, Periodic Jobs Using Imprecise Results
- Liu, Lin, et al.
- 1987
(Show Context)
Citation Context ...AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory [33; 8; 6; 36] and real-time systems =-=[22; 21; 7]-=-. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a general decisiontheoretic framewo... |

47 |
An inference technique for integrating knowledge from disparate sources
- Garvey, Lowrance, et al.
- 1995
(Show Context)
Citation Context ...light generalizations of rules that appear in the literature in the sense that we have added a fixed conditioning proposition ffi. Rules (xx) and (xxi) are presented by Garvey, Lowrance, and Fischler =-=[13]-=-. A derivation of rule (xx) can be found in a paper by Dubois [11]. Rule (xxv) for introducing conjunction is also presented by Ursic [34]. Rules (xxiii) and (xxiv) accomplish a transformation similar... |

44 |
Inferno: A cautious approach to uncertain inference
- Quinlan
- 1983
(Show Context)
Citation Context ... entailment. Bundy's approach, like Nilsson's, requires performing an initial impractical computation. Another approach to computing probabilistic entailment is Quinlan's network propagation approach =-=[31]-=-. This method has its own limitations. Quinlan's method works with a static network representing a fixed set of formulas and relationships among them. Because it is unable to form new formulas as is d... |

41 |
Incidence calculus: a mechanism for probabilistic reasoning
- Bundy
- 1984
(Show Context)
Citation Context ...lanation-based learning algorithms. These drawbacks are inherited by subsequently developed elaborations of Nilsson's basic approach [35; 32]. A related approach to computing probabilities is Bundy's =-=[4]-=- incidence calculus. This approach was proposed prior to the publication of Nilsson's probabilistic logic and so was not described in terms of his semantics. But if viewed in terms of the semantics of... |

34 | H.: Variable Precision Logic
- Michalski, Winston
(Show Context)
Citation Context ...inlan's [31] inferno system is also an anytime deduction procedure but he did not present or discuss it as such. 13 In 1986 Haddawy [15] presented an inference system based on Michalski and Winston's =-=[23]-=- Variable Precision Logic that could vary the precision of its inference to produce an answer to a given query within a specified amount of time. That system, however, lacks the important property tha... |

32 | Constraint propagation with imprecise conditional probabilities
- Amarger, Dubois, et al.
- 1994
(Show Context)
Citation Context ...entions some of the subsequent research on this topic. 2 For an earlier investigation of probabilistic entailment for both propositional and first-order logic see the article by Adams and Levine [1]. =-=[2]-=- extend Quinlan's approach with rules for the derivation of conditional probabilities, as well as means of introducing new nodes. However, the new nodes are limited to conjunctions and disjunctions of... |

32 |
Anytime Rescheduling
- Zweben, Dealt, et al.
- 1990
(Show Context)
Citation Context ...t we have some notion of the marginal improvement in an answer as a function of a marginal increase in computation time. Since then researchers have presented anytime algorithms for other AI problems =-=[10; 37]-=-. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory [33; 8; 6; 36] and real-time systems [22; 21; 7]. In the ... |

26 | A semantics for complex objects and approximate queries
- Buneman, Davidson, et al.
- 1988
(Show Context)
Citation Context ...esented anytime algorithms for other AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory =-=[33; 8; 6; 36]-=- and real-time systems [22; 21; 7]. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a... |

26 |
Probabilistic logic revisited
- Nilsson
- 1993
(Show Context)
Citation Context ...line of reasoning involving formulas other than those built into the network. The network can only propagate probability constraints among its existing formulas. Amarger, Dubois and Prade 1 Nilsson's =-=[26]-=- retrospective on the paper mentions some of the subsequent research on this topic. 2 For an earlier investigation of probabilistic entailment for both propositional and first-order logic see the arti... |

21 |
An inequality paradigm for probabilistic knowledge
- Grosof
- 1986
(Show Context)
Citation Context ... is a closed interval. This property does not hold for point probabilities; though the sentences in \Psi may all have point probabilities, the tight entailment of (OE j ��) may not be a point. Gro=-=sof [14]-=- also observed this closure property in relation to his Type-1-ui theories. This property is important for the formulation of inference rules since the rules must be applicable to the sentences they d... |

21 |
Monotonically improving approximate answers to relational algebra queries. COMPSAC-89
- Smith, Liu
- 1989
(Show Context)
Citation Context ...esented anytime algorithms for other AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory =-=[33; 8; 6; 36]-=- and real-time systems [22; 21; 7]. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a... |

18 |
An object-oriented query processor that returns monotonically improving approximate answers
- Vrbsky, Liu
- 1990
(Show Context)
Citation Context ...esented anytime algorithms for other AI problems [10; 37]. The concept of an algorithm that produces approximate answers that improve with time has also appeared in the literature on data base theory =-=[33; 8; 6; 36]-=- and real-time systems [22; 21; 7]. In the literature on real-time systems, such algorithms are known as imprecise, monotone algorithms. Concurrent with Dean and Boddy's work, Horvitz [19] presented a... |

14 |
Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
- Bundy
- 1986
(Show Context)
Citation Context ...s on the probabilities of the associated sentences. This algorithm fits our definition of an anytime deduction procedure and is shown to be both sound and complete for unconditional sentences of L PL =-=[5]-=-. The major drawback of Bundy's approach is the lack of a general mechanism for assigning the initial incidences to a set of sentences, given their probabilities. The difficulty arises because each po... |

13 |
On the uncertainties transmitted from premises to conclusions in deductive inferences
- Adams, Levine
- 1975
(Show Context)
Citation Context ...per mentions some of the subsequent research on this topic. 2 For an earlier investigation of probabilistic entailment for both propositional and first-order logic see the article by Adams and Levine =-=[1]-=-. [2] extend Quinlan's approach with rules for the derivation of conditional probabilities, as well as means of introducing new nodes. However, the new nodes are limited to conjunctions and disjunctio... |

9 |
Partial computation in real-time database systems
- Davidson, Watters
- 1988
(Show Context)
Citation Context |

7 |
Modal logics of higher-order probability
- Haddawy, Frisch
- 1990
(Show Context)
Citation Context |

7 |
Computing probability intervals under independency constraints
- Gaag
- 1991
(Show Context)
Citation Context ...uch proofs are useful as explanations to humans and as input to explanation-based learning algorithms. These drawbacks are inherited by subsequently developed elaborations of Nilsson's basic approach =-=[35; 32]-=-. A related approach to computing probabilities is Bundy's [4] incidence calculus. This approach was proposed prior to the publication of Nilsson's probabilistic logic and so was not described in term... |

5 |
Probabilistic logic
- Paass
- 1988
(Show Context)
Citation Context ...hese assignments are then used to set up a system of linear equations that expresses the constraints among the probability distribution over these assignments and the probabilities of LC(\Psi). Paass =-=[28]-=- generalizes this method to allow \Psi to contain conditional probability sentences with arbitrary probability intervals. The target sentence must still be an unconditional probability. This more gene... |

4 |
Combination and Propagation of Uncertainty with Belief Functions
- Dubois, Prade
- 1985
(Show Context)
Citation Context ...e sense that we have added a fixed conditioning proposition ffi. Rules (xx) and (xxi) are presented by Garvey, Lowrance, and Fischler [13]. A derivation of rule (xx) can be found in a paper by Dubois =-=[11]-=-. Rule (xxv) for introducing conjunction is also presented by Ursic [34]. Rules (xxiii) and (xxiv) accomplish a transformation similar to Pearl's [29] clustering technique for removing loops in Bayes ... |

4 | Decision making with linear constraints on probabilities - Pittarelli - 1988 |

4 |
Generalizing fuzzy logic probabilistic inferences, in Uncertainty in
- Ursic
- 1988
(Show Context)
Citation Context ...xx) and (xxi) are presented by Garvey, Lowrance, and Fischler [13]. A derivation of rule (xx) can be found in a paper by Dubois [11]. Rule (xxv) for introducing conjunction is also presented by Ursic =-=[34]-=-. Rules (xxiii) and (xxiv) accomplish a transformation similar to Pearl's [29] clustering technique for removing loops in Bayes nets. Rules (viii) and (ix) are respectively the the generalized Bayes' ... |

1 |
Implementation of and experiments with a variable precision logic inference system
- Haddawy
- 1986
(Show Context)
Citation Context ...ince P(ff j fi) = P(ffsfi)=P(fi), he suggests using the matrix 12 Quinlan's [31] inferno system is also an anytime deduction procedure but he did not present or discuss it as such. 13 In 1986 Haddawy =-=[15]-=- presented an inference system based on Michalski and Winston's [23] Variable Precision Logic that could vary the precision of its inference to produce an answer to a given query within a specified am... |

1 |
Probabilistic reasoning in logic programming
- Ng, Subrahmanian
- 1990
(Show Context)
Citation Context ...ocedure. They further extend inferno's network approach with rules for introducing new nodes. These new nodes are limited to conjunctions and disjunctions of nodes in the network. Ng and Subrahmanian =-=[25; 24]-=- formulate a sound and complete inference system based on SLD deduction (as used in logic programming) for a class of probabilistic entailment problems that is almost totally disjoint from those addre... |

1 | Probabilities that imply certainties - Shvaytser - 1990 |