|
CS 591, Section EA Advanced Reasoning in AI Autumn 2004 Tentative Course Syllabus |
| Approximate Schedule |
| Session | Date | Topic | Readings | Sample Application Reading |
Assignment |
|---|---|---|---|---|---|
| |
|
Coordination Meeting | |
| Papers for Presentations |
| Number | Topic | Paper/s | Sample Application Reading |
Presenter |
|---|---|---|---|---|
| |
SAT via stochastic local search | Planning via SAT: [Kautz etal '96], [Kautz & Selman '96] |
Geoffrey Levine | |
| |
Binary Decision Diagrams | TBA TBA |
Afsaneh Shirazi | |
| |
Consequence finding | TBA TBA |
||
| |
Prime implicates/implicants | TBA TBA |
||
| |
Constraint satisfaction problems | TBA TBA |
Kenton McHenry | |
| |
Equational reasoning in FOL | Commonsense reasoning TBA |
||
| |
DPLL in FOL | TBA TBA |
||
| |
FOL: decidable fragments | Formal verification TBA |
Deepak Ramachandran | |
| |
Treewidth-finding algorithms | TBA TBA |
||
| |
Probabilistic inference with continuous variables | TBA TBA |
Michael Simon | |
| |
Metropolis-Hastings: Theory and examples | TBA TBA |
||
| |
Dynamic Probabilistic Relational Models | TBA TBA |
Anna Yershova | |
| |
Variational approximations for probabilistic inference | Biology:
[Xing etal '03] information retrieval: [Blai etal '02] |
Vince Horrell | |
| |
Loopy belief propagation | Turbo Coding [McEliece, MacKay & Cheng '98] |
Jakob Metzler | |
| |
Resolution in first-order probabilistic models | TBA TBA |
Rodrigo Braz | |
| |
SAT via probabilistic reasoning | TBA TBA |
Hannaneh Hajishirzi | |
| |
Dynamic Bayes networks and particle filtering | Sensor Networks:
[Coates '04] Mobile Robots: [Fox etal '01] |
Hanning Zhou | |
| |
Kalman filtering | SLAM SLAM2.0 |
Joseph Tucek | |
| |
Factored inference with DBNs | SLAM: [Paskin '03] |
Shiau Hong Lim | |
| |
Resolution strategies | TBD TBD |
Bill Davis | |
| |
Probabilistic equational reasoning | Co-reference resolution TBD |
Arthur Kantor | |
| |
Dynamic backtracking for SAT | TBD TBD |
Phil Oertel | |
| |
Clauses/Variables ratio in SAT | TBD TBD |
Xiaoxin Yin | |
| |
Dynamic ordering strategies for SAT (*NOTE: SAME AS 21) | TBD TBD |
(taken) | |
| |
Decayed MCMC | Tracking [Khan etal. '03] |
| Number | Topic | Presenter |
|---|---|---|
| |
extension of lock resolution using craig's interpolation theorem | |
| |
hybrid reasoning of logic and probabilities via partitioning (requires knowledge of FOPL, at least Halpern's work) | |
| |
logical filtering with a first-order language | |
| |
logical filtering with BDDs | |
| |
activity detection using filtering (any method) | |
| |
SLAM2.0 improved and applied to a mobile robot | |
| |
Combining logical filtering and stochastic filtering | |
| |
Survey propagation for dynamic settings (e.g., planning via SAT) | |
| |
Approximation algorithm for hyper-treewidth | |
| |
Implementation of an algorithm for planar treewidth | |
| |
Filtering in an adventure/strategy game | |
| |
Labeling image segments with words (using a probabilistic graphical model) | |
| |
Implementation of Message-Passing as a restriction strategy for reasoning in FOL | |
| |
Complete ``holes'' in Poole's paper on resolution in first-order probabilistic models | |
| |
Equational reasoning in first-order probabilistic models | |
| |
First-Order DPLL with equality | |
| |
LSA-like robot control architecture with probabilities | |
| |
Learning action models via filtering | |
| |
MCMC for image segmentation | |
| |
Robot localization for a basketball game | |
| |
LSA-based control system for a robotic arm |
| Projects |
| Number | Topic | Presenter |
|---|---|---|
| |
Logical filtering with a first-order language | Afsaneh Shirazi |
| |
Combining logical filtering and stochastic filtering | Joseph Tucek |
| |
A system for the control of a robotic arm | Anna Yershova |
| |
Image segmentation using MCMC: Implementation | Vince Horrell |
| |
Boyen-Koller for car tracking | Shiau Hong Lim |
| |
Comparing CSP algorithms | Kenton McHenry |
| |
Survey propagation for dynamic settings (e.g., planning via SAT) | |
| |
Filtering in an adventure/strategy game | |
| |
Labeling image segments with words (using a probabilistic graphical model) | |
| |
Implementation of Message-Passing as a restriction strategy for reasoning in FOL | |
| |
Complete ``holes'' in Poole's paper on resolution in first-order probabilistic models | |
| |
Equational reasoning in first-order probabilistic models | |
| |
First-Order DPLL with equality | |
| |
LSA-like robot control architecture with probabilities | |
| |
Learning action models via filtering | |
| |
MCMC for image segmentation | |
| |
Robot localization for a basketball game |
| Bibliography |
| Key | Authors | Title |
|---|---|---|
| [McCarthy '58] | John McCarthy | Programs with Common Sense |
| [Amir & Maynard-Reid '99] | Eyal Amir and Pedrito Maynard-Reid II | Logic-Based Subsumption Architecture |
| [Russell & Norvig '03] | Stuart Russell and Peter Norvig | Artificial Intelligence, a Modern Approach |
| [Genesereth & Nilsson '87] | Michael R. Genesereth and Nils J. Nilsson | Logical Foundations for Artificial Intelligence |
| [McFarland '93] | Michael C. McFarland | Formal verification of sequential hardware: a tutorial |
| [Biere etal. '99] | A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu | Symbolic model checking using SAT procedures instead of BDDs |
| [Barrett '03] | Clark Barrett | Logic in Computer Science, NYU, Fall 2003 |
| [OpenGalen '03] | OpenGALEN, by Kermanog | GALEN common reference model, version 1.02, and software |
| [Baader & Nutt '03] | Franz Baader & Werner Nutt | Basic Description Logics, Ch.2 in the Description Logic Handbook |
| [Franconi '03] | Enrico Franconi | Natural Language Processing, Ch.15 in the Description Logic Handbook |
| [Gadsil, Koller, & Striegnitz '01] | M. Gabsdil, A. Koller, and K. Striegnitz | Building a Text Adventure on Description Logic |
| [Horrocks '02] | Ian Horrocks | DAML+OIL: a Description Logic for the Semantic Web |
| [Amir & McIlraith '03] | Eyal Amir and Sheila McIlraith | Partition-Based Reasoning for First-Order and Propositional Theories |
| [MacCartney etal. '03] | B. MacCartney, S. McIlraith, E. Amir, & T. Uribe | Practical Partition-Based Theorem Proving for Large Knowledge Bases |
| [Amir & Engelhardt '03] | Eyal Amir and Barbara Engelhardt | Factored Planning |
| [Rish & Dechter '00] | Irina Rish and Rina Dechter | Resolution versus Search: Two Strategies for SAT |
| [Doucet etal '00] | Arnaud Doucet, Nando de Freitas, Kevin Murphy, Stuart Russell | Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks, Tutorial, and slides |
| [Doucet etal '00b] | Arnaud Doucet, Simon Godsill, and Christophe Andrieu | On sequential Monte-Carlo sampling methods for Bayesian filtering |
| [Coates '04] | Mark Coates | Distributed particle filters for sensor networks |
| [Fox etal '01] | Dieter Fox, Sebastian Thrun, Wolfram Burgard, Frank Dellaert | Particle Filters for Mobile Robot Localization |
| [Moskewicz etal '01] | M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik | Chaff: engineering an efficient SAT solver |
| [Ginsberg and McAllester '94] | M. Ginsberg and D. McAllester | GSAT and Dynamic Backtracking |
| [Selman, Mitchell, and Levesque '97] | B. Selman, D. Mitchell, and H. Levesque | Generating hard satisfiability problems |
| [MacKay '98] | David MacKay | Introduction to Monte Carlo methods |
| [Crick & Pfeffer '03] | Christopher Crick and Avi Pfeffer | Loopy belief propagation as a basis for communication in sensor networks |
| [Yedidia etal. '03] | J.S. Yedidia, W.T. Freeman and Y. Weiss | Bethe free energy, Kikuchi approximations and belief propagation algorithms |
| [McEliece, MacKay & Cheng '98] | R.J. McEliece, D. J. C. MacKay, and J. F. Cheng | Turbo decoding as an instance of Pearl's `belief propagation |
| [Poole '03] | David Poole | First-order probabilistic inference |
| [Braunstein etal '03] | A. Braunstein, M. Mezard, R. Zecchina | Survey propagation: an algorithm for satisfiability |
| [Amir & Russell '03] | E. Amir and S. Russell | Logical Filtering |
| [Jaakola '00] | T. Jaakola | Tutorial on variational approximation methods (slides) |
| [El-Hay & Friedman '01] | T. El-Hay and N. Friedman | Incorporating Expressive Graphical Models in Variational Approximations: Chain-Graphs and Hidden Variables |
| [Tu & Zhu '02] | Zhuowen Tu and Song-Chun Zhu | Image Segmentation by Data-Driven Markov Chain Monte Carlo |
| [Wei & Altman '97] | L. Wei and R. B. Altman | An Automated System for Generating Comparative Disease Profiles and Making Diagnoses |
| [Segal etal. '03] | E. Segal and R. Yelensky and D. Koller | Genome-wide Discovery of Transcriptional Modules from DNA Sequence and Gene Expression |
| [Baumgartner '00] | Peter Baumgartner | FDPLL - A First-Order Davis-Putnam-Logeman-Loveland Procedure |
| [Khan etal. '03] | Z. Khan, T. Balch, and F. Dellaert | An MCMC-based Particle Filter for Tracking Multiple Interacting Targets |
| [Marthi etal. '03] | B. Marthi, H. Pasula, and S. Russell | Decayed MCMC Filtering |
| [Pfeffer '00] | A. Pfeffer | Probabilistic Reasoning for Complex Systems |
| [Pasula & Russell '00] | H. Pasula and S. Russell | Approximate Inference For First-Order Probabilistic Languages |
| [Pasula etal. '02] | H. Pasula, B. Marthi, B. Milch, S. Russell, I. Shpitser | Identity Uncertainty and Citation Matching |
| [del Val '99] | A. del Val | A New Method for Consequence Finding and Compilation for Restricted Languages |
| [de Kleer '92] | J. de Kleer | An Improved Incremental Algorithm for Generating Prime Implicates |
| [Slagle etal. '70] | J.R. Slagle, C.-L. Chang and R. Lee | A new algorithm for generating prime implicants |
| [Groote & Zantema '00] | J.F. Groote and H. Zantema | Resolution and binary decision diagrams cannot simulate each other polynomially |
| [Groote & Tveretina '03] | J.F. Groote and O. Tveretina | Binary decision diagrams for first-order predicate logic |
| [Sanghai, Domingo, & Weld '03] | S. Sanghai, P. Domingo, and D. Weld | Dynamic Probabilistic Relational Models |
| [Rabiner '89] | L.R. Rabiner | A tutorial on hidden Markov models and selected applications in speech recognition |
| [Lerner & Parr '01] | U. Lerner and R. Parr | Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms |
| Key | Authors | Title |
| Key | Authors | Title |
| Key | Authors | Title |
| Key | Authors | Title |
| Key | Authors | Title |
| Key | Authors | Title |
| Viewing PostScript and PDF |
Depending on the computer you are using, you may be able to download a PostScript viewer or PDF viewer for it if you don't already have one.
| Comments to Eyal Amir |