- Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation Paulo Shakarian, Gerardo I. Simari and V.S. Subrahmanian (Electronic Appendix)
- Simplification Rules for Intuitionistic Propositional Tableaux Mauro Ferrari, Camillo Fiorentini and Guido Fiorino
- Complexity of Data Dependence problems for Program Schemas with Concurrency Sebastian Danicic, Robert M Hierons, Michael R Laurence
- On the Relative Strength of Pebbling and Resolution Jakob Nordström
- The Complexity of Reasoning for Fragments of Autoepistemic Logic Nadia Creignou, Arne Meier, Michael Thomas and Heribert Vollmer