An algorithm for computing propositions
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|an algorithm for computing propositions }}
- [[]]
bibtex
{{#vardefine:pagename|An algorithm for computing propositions }}{{#vardefine:key| }}
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.
download:
- paper:
- slides:
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 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. ze of a number of common types of queries. |
| Author | Gregory F. Cooper + |
| Bibtype | techreport + |
| Institution | Knowledge Systems, AI Laboratory + |
| Key | KSL-87-21 + |
| Month | June + |
| Number | KSL-87-21 + |
| Tag | Computer science + |
| Title | An Algorithm for Computing Propositions + |
| Tr id | KSL-87-21 + |
| Year | 1987 + |
