2. CSL 1988: Duisburg, Germany

@proceedings{DBLP:conf/csl/1988,
  editor    = {Egon B{\"o}rger and
               Hans Kleine B{\"u}ning and
               Michael M. Richter},
  title     = {CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany,
               October 3-7, 1988, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {385},
  year      = {1989},
  isbn      = {3-540-51659-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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