Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
lopro [2011/09/25 14:17] val.tannen |
lopro [2011/09/25 14:20] val.tannen |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| //Syllabus// | //Syllabus// | ||
| - | -Introduction | ||
| - | -Truth, proof, and computation: some basic results about first-order logic | ||
| - | -A bit of the story of how Mathematical Logic (and Electronic Technology) gave birth to Computer Science. | ||
| - | Part I: Probability of Logic | + | *Introduction |
| + | *Truth, proof, and computation: some basic results about first-order logic | ||
| + | *A bit of the story of how Mathematical Logic (and Electronic Technology) gave birth to Computer Science. | ||
| - | Random graphs and random structures | + | *Part I: Probability of Logic |
| - | 0-1 laws | + | *Random graphs and random structures |
| - | Queries on probabilistic databases | + | *0-1 laws |
| + | *Queries on probabilistic databases | ||
| - | Part II: Logic of Probability | + | *Part II: Logic of Probability |
| - | + | *Pearl-Paz logics for reasoning about probabilistic (in)dependence | |
| - | Pearl-Paz logics for reasoning about probabilistic (in)dependence | + | *Reasoning about independence in Bayesian and Markov networks; the Hammersley-Clifford theorem |
| - | Reasoning about independence in Bayesian and Markov networks; the Hammersley-Clifford theorem | + | *Reasoning about independence in relational graphical models (PRMs and RMNs) |
| - | Reasoning about independence in relational graphical models (PRMs and RMNs) | + | |