| 1 | -- | 20 | Clemens Ballarin, Lawrence C. Paulson. A Pragmatic Approach to Extending Provers by Computer Algebra - with Applications to Coding Theory |
| 21 | -- | 38 | Belaid Benhamou, Laurent Henocque. A Hybrid Method for Finite Model Search in Equational Theories |
| 39 | -- | 57 | Piergiorgio Bertoli, Jacques Calmet, Fausto Giunchiglia, Karsten Homann. Specification and Integration of Theorem Provers and Computer Algebra Systems |
| 59 | -- | 83 | Uwe Egly, Stephan Schmitt. On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis |
| 85 | -- | 104 | Stéphane Fèvre, Dongming Wang. Combining Clifford Algebraic Computing and Term-Rewriting for Geometric Theorem Proving |
| 105 | -- | 121 | Melvin Fitting. On Quantified Modal Logic |
| 123 | -- | 143 | Dirk Fuchs. On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi |
| 145 | -- | 165 | Christopher Lynch, Christelle Scharff. Basic Completion with E-cycle Simplification |
| 167 | -- | 187 | Eric Monfroy, Christophe Ringeissen. An Open Automated Framework for Constraint Solver Extension: the SoleX Approach |
| 189 | -- | 209 | Brigitte Pientka, Christoph Kreitz. Automating Inductive Specification Proofs |
| 211 | -- | 228 | J. Rafael Sendra, Franz Winkler. Algorithms for Rational Real Algebraic Curves |