• 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

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