• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 25 matches

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