An Algorithm for Computing Propositions

From Tetherless World Wiki

Jump to: navigation, search

Citation: Gregory F. Cooper. (1987) An Algorithm for Computing Propositions. In KSL-87-21, June,1987.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Gregory F. Cooper
title An Algorithm for Computing Propositions
number KSL-87-21
institution Knowledge Systems, AI Laboratory
year 1987
month June
Bibtex more
Access Paper
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 instantiated 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.

KSL Technical Report ID: KSL-87-21
Facts about An Algorithm for Computing PropositionsRDF feed
Abstract An algorithm for computing probabilistic p 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 instantiated 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. ze of a number of common types of queries.
Author Gregory F. Cooper  +
Bibtype techreport  +
Has author Gregory F. Cooper  +
Has identifier KSL-87-21  +
Has publishing details June,1987  +
Has title An Algorithm for Computing Propositions  +
Has where published KSL-87-21  +
Has year 1987  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-87-21  +
Month June  +
Number KSL-87-21  +
Process note YES  +
Title An Algorithm for Computing Propositions  +
Year 1987  +
Personal tools