| 1989 | CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings Egon Börger, Hans Kleine Büning, Michael M. Richter |
| 1988 | A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. Elmar Eder |
| 1988 | A Remark on Minimal Polynomials of Boolean Functions. Bernd Voigt, Ingo Wegener |
| 1988 | A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems. Marco Danelutto, Andrea Masini |
| 1988 | An Interpreter with Lazy Evaluation for Prolog with Functions. Stefan Lüttringhaus |
| 1988 | Boolean Complexity of Algebraic Interpolation Problems. Marek Karpinski |
| 1988 | Characterizing Complexity Classes by General Recursive Definitions in Higher Types. Andreas Goerdt |
| 1988 | Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. Elias Dahlhaus |
| 1988 | Delete Operations and Horn Formulas. Rüdiger Schätz |
| 1988 | Enforcement of Integrity Constraints in a Semantic Data Model. Norbert Südkamp, Peter Kandzia |
| 1988 | Gentzen-Systems for Propositional Temporal Logics. Barbara Paech |
| 1988 | Integration of Descriptive and Procedural Language Constructs. Wolfgang Schönfeld, Werner Stephan |
| 1988 | Interval Temporal Logic and Star-Free Expressions. D. Lippert |
| 1988 | Is Average Superlinear Speedup Possible? Ewald Speckenmeyer |
| 1988 | Loop Detection in Propositional Prolog Programs. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen |
| 1988 | Normal Forms and the Complexity of Computations of Logic Programs. Vít Ochozka, Olga Stepánková, Petr Stepánek |
| 1988 | Numberings of R Martin Kummer |
| 1988 | On Disjunctive Self-Reducibility. Klaus Ambos-Spies, Jürgen Kämper |
| 1988 | On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. Ilkka Niemelä |
| 1988 | On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. Hubert Wagener |
| 1988 | On the Existence of Fair Schedulers. Lutz Priese |
| 1988 | Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. Lutz Plümer |
| 1988 | Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. Erich Grädel |
| 1988 | The Knowledge Representation Language L Christoph Beierle, Jochen Dörre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer |
| 1988 | Using Finite-Linear Temporal Logic for Specifying Database Dynamics. Gunter Saake, Udo W. Lipeck |