An Algorithm for Computing Propositions

Reference: Cooper, G. F. An Algorithm for Computing Propositions. June, 1987.

Abstract: An algorithm for computing probabilistic propositions is presented. It assumes the availability of a single external routine for computing the probability of one instantiated variable, given a conjunction of other insantiated variables. Although the time complexity of the algorithm is exponential in the size of a query, it is polynomial in the size of a number of common types of queries.

Jump to... [KSL] [SMI] [Reports by Author] [Reports by KSL Number] [Reports by Year]
Send mail to: ksl-info@ksl.stanford.edu to send a message to the maintainer of the KSL Reports.