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:24] val.tannen |
||
---|---|---|---|
Line 3: | Line 3: | ||
**Doctoral course by Val Tannen** | **Doctoral course by Val Tannen** | ||
- | //Syllabus// | + | lecture notes 1 [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/ln1.pdf|(pdf)]] |
- | -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 | + | //Syllabus// |
- | Random graphs and random structures | + | *Introduction |
- | 0-1 laws | + | *Truth, proof, and computation: some basic results about first-order logic |
- | Queries on probabilistic databases | + | *A bit of the story of how Mathematical Logic (and Electronic Technology) gave birth to Computer Science. |
- | Part II: Logic of Probability | + | *Part I: Probability of Logic |
+ | *Random graphs and random structures | ||
+ | *0-1 laws | ||
+ | *Queries on probabilistic databases | ||
- | Pearl-Paz logics for reasoning about probabilistic (in)dependence | + | *Part II: Logic of Probability |
- | Reasoning about independence in Bayesian and Markov networks; the Hammersley-Clifford theorem | + | *Pearl-Paz logics for reasoning about probabilistic (in)dependence |
- | Reasoning about independence in relational graphical models (PRMs and RMNs) | + | *Reasoning about independence in Bayesian and Markov networks; the Hammersley-Clifford theorem |
+ | *Reasoning about independence in relational graphical models (PRMs and RMNs) | ||