| 1988 | Delete Operations and Horn Formulas. | Rdiger Schtz |
| 1988 | Using Finite-Linear Temporal Logic for Specifying Database Dynamics. | Gunter Saake, Udo W. Lipeck |
| 1988 | On the Existence of Fair Schedulers. | Lutz Priese |
| 1988 | Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. | Lutz Plmer |
| 1988 | Gentzen-Systems for Propositional Temporal Logics. | Barbara Paech |
| 1988 | Normal Forms and the Complexity of Computations of Logic Programs. | Vt Ochozka, Olga Stepnkov, Petr Stepnek |
| 1988 | On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. | Ilkka Niemel |
| 1988 | An Interpreter with Lazy Evaluation for Prolog with Functions. | Stefan Lttringhaus |
| 1988 | Interval Temporal Logic and Star-Free Expressions. | D. Lippert |
| 1988 | Numberings of R | Martin Kummer |
| 1988 | Boolean Complexity of Algebraic Interpolation Problems. | Marek Karpinski |
| 1988 | Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. | Erich Grdel |
| 1988 | Characterizing Complexity Classes by General Recursive Definitions in Higher Types. | Andreas Goerdt |
| 1988 | A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. | Elmar Eder |
| 1988 | A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems. | Marco Danelutto, Andrea Masini |
| 1988 | Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. | Elias Dahlhaus |
| 1988 | Loop Detection in Propositional Prolog Programs. | Hans Kleine Bning, Ulrich Lwen, Stefan Schmitgen |
| 1988 | The Knowledge Representation Language L | Christoph Beierle, Jochen Drre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer |
| 1988 | On Disjunctive Self-Reducibility. | Klaus Ambos-Spies, Jrgen Kmper |
| 1987 | Algorithms for Propositional Updates. | Andreas Weber |
| 1987 | Model Theory of Deductive Databases. | Hugo Volger |
| 1987 | Developing Logic Programs: Computing Through Normalizing. | Olga Stepnkov, Petr Stepnek |
| 1987 | On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. | Dieter Spreen |
| 1987 | On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. | Ewald Speckenmeyer |
| 1987 | Complexity Cores and Hard-To-Prove Formulas. | Uwe Schning |