| 1 | | A. Basso, A. Bolotov, and V. Getov: State-Based Behavior Specification for GCM Systems |
| 2 | | A. Bolotov and O. Grigoriev: Natural Deduction Calculus for Quantified Propositional Linear-time Temporal Logic (QPTL) |
| 3 | | L. A. Dennis and L. Dixon: Adapting Piecewise Fertilisation to Reason about Hypotheses |
| 4 | | S. Feng: Combining Generalisation Into Instantiation Based Reasoning In EPR |
| 5 | | M. Horridge, B. Paris, and U. Sattler: Computing Explanations for Entailments in Description Logic Based Ontologies |
| 6 | | B. Konev, C. Dixon, and M. Fisher: "Exactly One" Epistemic Logic |
| 7 | | S. Konur and M. Fisher: Verification of Pervasive Systems |
| 8 | | S. Konur: A Decidable Approach to Real-time System Specification |
| 9 | | M. Ludwig and U. Hustadt: TSPASS - a Fair Monodic Temporal Logic Prover |
| 10 | | Q.-a. Mahesar and V. Sorge: Classification of Quasigroup-structures with respect to their Cryptographic Properties |
| 11 | | C. Power and A. Miller: Symmetry Reduction of Partially Symmetric Systems |
| 12 | | R. Ramezani and S. Colton: Solving Mutilated Problems |
| 13 | | S. H. Ripon and A. Miller: Semantic Embedding of Promela-Lite in PV |
| 14 | | M. Risdale, M. Jamnik, N. Benton, and J. Berdine: Diagrammatic Reasoning for Software Verification |
| 15 | | R. A. Schmidt: The Ackermann Approach for Modal Logic, Correspondence Theory and Second-Order Reduction |
| 16 | | R. A. Schmidt and D. Tishkovsky: Synthesising Tableau Decision Procedures |
| 17 | | G. Stapleton, M. Jamnik, and J. Masthoff: On the Readability of Diagrammatic Proofs |
| 18 | | C. Sticksel: Efficient Ground Satisfiability Solving in an Instantiation-based Method for First-order Theorem Proving |
| 19 | | P. Torres and S. Colton: First-Order Logic Concept Symmetry for Theory Formation |
| 20 | | M. Webster, L. Dennis, and M. Fisher: Model-Checking Auctions, Coalitions and Trust |
| 21 | | L. Zhang, U. Hustadt, and C. Dixon: CTL-RP: A Computational Tree Logic Resolution Prover |
