2. CSL 1988: Duisburg, Germany

• Klaus Ambos-Spies, Jürgen Kämper:
  On Disjunctive Self-Reducibility. 1-13
  
• Christoph Beierle, Jochen Dörre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer:
  The Knowledge Representation Language L_LILOG. 14-51
  
• Elias Dahlhaus:
  Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. 52-62
  
• Marco Danelutto, A. Masini:
  A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems. 63-79
  
• Elmar Eder:
  A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. 80-98
  
• Andreas Goerdt:
  Characterizing Complexity Classes by General Recursive Definitions in Higher Types. 99-117
  
• Erich Grädel:
  Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. 118-137
  
• Marek Karpinski:
  Boolean Complexity of Algebraic Interpolation Problems. 138-147
  
• Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
  Loop Detection in Propositional Prolog Programs. 148-165
  
• Martin Kummer:
  Numberings of R₁ union F. 166-186
  
• D. Lippert:
  Interval Temporal Logic and Star-Free Expressions. 187-198
  
• Stefan Lüttringhaus:
  An Interpreter with Lazy Evaluation for Prolog with Functions. 199-225
  
• Ilkka Niemelä:
  On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. 226-239
  
• Barbara Paech:
  Gentzen-Systems for Propositional Temporal Logics. 240-253
  
• Lutz Plümer:
  Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. 254-271
  
• Lutz Priese:
  On the Existence of Fair Schedulers. 272-287
  
• Gunter Saake, Udo W. Lipeck:
  Using Finite-Linear Temporal Logic for Specifying Database Dynamics. 288-300
  
• Ewald Speckenmeyer:
  Is Average Superlinear Speedup Possible? 301-312
  
• Norbert Südkamp, Peter Kandzia:
  Enforcement of Integrity Constraints in a Semantic Data Model. 313-328
  
• Rüdiger Schätz:
  Delete Operations and Horn Formulas. 329-343
  
• Wolfgang Schönfeld, Werner Stephan:
  Integration of Descriptive and Procedural Language Constructs. 344-356
  
• Vít Ochozka, Olga Stepánková, Petr Stepánek:
  Normal Forms and the Complexity of Computations of Logic Programs. 357-371
  
• Bernd Voigt, Ingo Wegener:
  A Remark on Minimal Polynomials of Boolean Functions. 372-383
  
• Hubert Wagener:
  On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. 384-399