1. CSL 1987: Karlsruhe, Germany

@proceedings{DBLP:conf/csl/1987,
  editor    = {Egon B{\"o}rger and
               Hans Kleine B{\"u}ning and
               Michael M. Richter},
  title     = {CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany,
               October 12-16, 1987, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {329},
  year      = {1988},
  isbn      = {3-540-50241-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig: Diagonalizing over Deterministic Polynomial Time. 1-16 BibTeX
• Karl-Hans Bläsius, Ulrich Hedtstück: Resolution with Feature Unification. 17-26 BibTeX
• Corrado Böhm, Adolfo Piperno: Surjectivity for Finite Sets of Combinators by Weak Reduction. 27-43 BibTeX
• François Bry, Rainer Manthey: Proving Finite Satisfiability of Deductive Databases. 44-55 BibTeX
• Elias Dahlhaus: Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. 56-63 BibTeX
• Giorgio Germano, Stefano Mazzanti: Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration. 64-80 BibTeX
• Yuri Gurevich, James M. Morris: Algebraic Operational Semantics and Modula-2. 81-101 BibTeX
• Maritta Heisel, Wolfgang Reif, Werner Stephan: Program Verification Using Dynamic Logic. 102-117 BibTeX
• Gerhard Jäger: Induction in the Elementary Theory of Types and Names. 118-128 BibTeX
• Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt: On the Computational Complexity of Quantified Horn Clauses. 129-137 BibTeX
• Katja Lenz, Ingo Wegener: The Conjunctive Complexity of Quadratic Boolean Functions. 138-150 BibTeX
• Hans Leiß: On Type Inference for Object-Oriented Programming Languages. 151-172 BibTeX
• Ulrich Löwen: Optimization Aspects of Logical Formulas. 173-187 BibTeX
• Helena Rasiowa: Logic of Approximation Reasoning. 188-210 BibTeX
• Ralf Rehrmann, Lutz Priese: Deciding the Path- and Word-Fair Equivalence Problem. 211-222 BibTeX
• Reinhard Rinn, Britta Schinzel: Learning by Teams from Examples with Errors. 223-234 BibTeX
• Peter H. Schmitt: A Survey of Rewrite Systems. 235-262 BibTeX
• Wolfgang Schönfeld: Interfacing a Logic Machine. 263-272 BibTeX
• Uwe Schöning: Complexity Cores and Hard-To-Prove Formulas. 273-280 BibTeX
• Ewald Speckenmeyer: On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. 281-288 BibTeX
• Dieter Spreen: On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. 289-303 BibTeX
• Olga Stepánková, Petr Stepánek: Developing Logic Programs: Computing Through Normalizing. 304-321 BibTeX
• Hugo Volger: Model Theory of Deductive Databases. 322-334 BibTeX
• Andreas Weber: Algorithms for Propositional Updates. 335-346 BibTeX