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:12] val.tannen |
lopro [2011/09/25 14:29] val.tannen |
||
---|---|---|---|
Line 3: | Line 3: | ||
**Doctoral course by Val Tannen** | **Doctoral course by Val Tannen** | ||
+ | Lecture notes 1 [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/ln1.pdf|(pdf)]] | ||
- | Introduction | + | //Course Materials// |
- | Truth, proof, and computation: some basic results about first-order logic | + | Old lecture notes on computability [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/compNotes.pdf|(pdf)]] |
- | A bit of the story of how Mathematical Logic (and Electronic Technology) gave birth to Computer Science. | + | |
- | Part I: Probability of Logic | + | "On the Unusual Effectiveness of Logic in Computer Science" Halpern, Harper, Immerman, Kolaitis, Vardi, and Vianu" [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/UnusualEffectiveness.pdf|(pdf)]] |
- | Random graphs and random structures | + | //Syllabus// |
- | 0-1 laws | + | |
- | Queries on probabilistic databases | + | |
- | Part II: Logic of Probability | + | *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. | ||
- | Pearl-Paz logics for reasoning about probabilistic (in)dependence | + | *Part I: Probability of Logic |
- | Reasoning about independence in Bayesian and Markov networks; the Hammersley-Clifford theorem | + | *Random graphs and random structures |
- | Reasoning about independence in relational graphical models (PRMs and RMNs) | + | *0-1 laws |
+ | *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) | ||
- | My lecture notes on Computability |