As Reading for Graduate Courses

 - Automated Theorem Proving,  (Required)
   Washington University in St. Louis
   (Aaron Stump, Fall 2007)

 - Semantics and Verification, (Recommended)
   Aalborg University
   (Kim Larsen), Spring 2005/2007

 - Decision Procedures for Verification (Required)
   Universitat des Saarlandes, Summer 2006
   (Bernd Finkbeiner), 

 - Decision Procedures (Required)
   University of New Mexico 
   (Deepak Kapur), Spring 2006

Regular Citations
-----------------
Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
Propositional Satisfiability and Constraint Programming: A Comparative Study
ACM Computing Surveys, Volume 38, Number 4, 2006

Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prenza Nieto, Alwen Tiu
"Expressiveness + Automation + Soundness: Towards Combining SMT Solvers 
 and Interactiv Proof Assistants"
TACAS'06

Cambarzard, Hadrien
Explanation Based Agorithms in Constraint Programming
PhD. Thesis, Universite de Nantes, 2006.

Martin Gebser and Torsten Schaub
"Tableaux Calculi for Answer Set Programming"
ICLP'06

Matthias Niklaus
Static Universe Type Inference Using as SAT Solver
Master's Thesis, ETH Zurich, 2006

Juan Antonio Navarro-Perez
"Translations to Propositional Satisfiability"
ARW'06

Patterson, Murray
Grounding for Model Expansion in K-Guarded Formulas with Inductive Definitions
MSc. Thesis, Simon Fraser University, 2006

Martin Gebser and Torsten Schaub
Characterizing ASP Inferences by Unit Propogation
LaSh'06

Mati Jarvisalo
"Impact of Restricted Branching on Clause Learning SAT Solving"
Helsinki Univerity of Technology, 
Laboratory for Theoretical Computer Science,
Technical Report HUT-TCS-A107, 2007

Hasan Amjad
"A Compressing Translation from Propositional Resolution To Natural Deduction"
FroCos'07

Hasan Amjad
Propositional Simplification with BDDs and SAT Solvers
TPHOLs'07

Martin Gebser and Torsten Schaub
Generic Tableaux for Answer Set Programming
ICLP'07

Martin Gebser, Benjamin Kaufman, Andre Neumann and Torsten Schaub
Conflict Driven Answer Set Programming
IJCAI'07

Martin Gebser, Benjamin Kaufman, Andre Neumann and Torsten Schaub
Conflict Driven Answer Set Enumeration
LPNMR'07

Martin Gebser, Benjamin Kaufman, Andre Neumann and Torsten Schaub
clasp: A Conflict-Driven Answer Set Solver
LPNMR'07

Martin Gebser
Advanced Techniques for Answer Set Programming
ICLP'07

Some Others
-----------
Ilkka Niemala
"Solving Industrial SAT Problems"
Invited Talk, Workshop on Networks and Algorithms: 
Complexity in Physics and Computer Science, Helsinki University, 2005 

Bibliography for "Constraint Satisfaction, Complexity and Logic"
Graduate Research Course, University of Rome La Sapienza
Marco Cadoli (with Phokion Kolaitis)
2005

Jussi Ritannen
"Reasoning About Dynamic Systems by Satisfiability Testing: 
 Planning, Model-Checking, and Diagnosis"
IJCAI'07 Tutorial  

Juan Antonio Navarro-Perez
"Effectively Propositional Theorem Proving"
PhD Continuation Report, U. of Manchester, 2005.