Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision Next revision Both sides next revision | ||
lopro [2011/09/21 18:39] vkuncak created |
lopro [2011/09/25 14:29] val.tannen |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Logic and Probability ====== | + | ====== EPFL Fall 2011: Logic and Probability ====== |
**Doctoral course by Val Tannen** | **Doctoral course by Val Tannen** | ||
+ | |||
+ | Lecture notes 1 [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/ln1.pdf|(pdf)]] | ||
+ | |||
+ | //Course Materials// | ||
+ | |||
+ | Old lecture notes on computability [[http://www.cis.upenn.edu/~val/LogicProbEPFL2011files/compNotes.pdf|(pdf)]] | ||
+ | |||
+ | "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)]] | ||
+ | |||
+ | //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 | ||
+ | *Random graphs and random structures | ||
+ | *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) | ||
+ | |||
+ | |||