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