• 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 27 matches

• 1994
• 
  Jürgen Avenhaus, Carlos Loría-Sáenz:
  Higher Order Conditional Rewriting and Narrowing. CCL 1994: 269-284
• 
  Leo Bachmair, Harald Ganzinger:
  Buchberger's Algorithm: A Constraint-Based Completion Procedure. CCL 1994: 285-301
• 
  Rolf Backofen, Ralf Treinen:
  How to Win a Game with Features. CCL 1994: 320-335
• 
  Peter Barth:
  Simplifying Clausal Satisfiability Problems. CCL 1994: 19-33
• 
  Renate Beckmann, Ulrich Bieker, Ingolf Markhof:
  Application of Constraint Logic Programming for VLSI CAD Tools. CCL 1994: 183-200
• 
  Alexandre Boudet, Evelyne Contejean:
  "Syntactic" AC-Unification. CCL 1994: 136-151
• 
  Witold Charatonik:
  Set Constraints in Some Equational Theories. CCL 1994: 304-319
• 
  Philippe Codognet, Giuseppe Nardiello:
  Path Consistency in clp(FD). CCL 1994: 201-216
• 
  Max Dauchet:
  Symbolic Constraints and Tree Automata. CCL 1994: 217-218
• 
  Rémi Gilleron, Sophie Tison, Marc Tommasi:
  Some new Decidability Results on Positive and Negative Set Constraints. CCL 1994: 336-351
• 
  Marianne Haberstrau:
  ECOLOG: an Environment for COnstraint LOGics. CCL 1994: 237-252
• 
  Andreas V. Hense, Gert Smolka:
  A Record Calculus with Principal Types. CCL 1994: 219-236
• 
  Patricia Johann, Rolf Socher-Ambrosius:
  Solving Simplification Ordering Constraints. CCL 1994: 352-367
• 
  Dexter Kozen:
  Set Constraints and Logic Programming. CCL 1994: 302-303
• 
  Denis Lugiez:
  Higher Order Disunification: Some decidable cases. CCL 1994: 121-135
• 
  Christopher Lynch:
  Local Simplification. CCL 1994: 3-18
• 
  Spiro Michaylov:
  Repeated Redundant Inequalities in Constraint Logic Programming. CCL 1994: 154-169
• 
  Joachim Niehren, Gert Smolka:
  A Confluent Relational Calculus for Higher-Order Programming with Constraints. CCL 1994: 89-104
• 
  Flemming Nielson, Hanne Riis Nielson:
  Constraints for Polymorphic Behaviours of Concurrent ML. CCL 1994: 73-88
• 
  Christian Prehofer:
  On Modularity in Term Rewriting and Narrowing. CCL 1994: 253-268
• 
  Zhenyu Qian, Kang Wang:
  Modular AC Unification of Higher-Order Patterns. CCL 1994: 105-120
• 
  Helmut Simonis:
  Applications of Constraint Logic Programming. CCL 1994: 152-153
• 
  Gert Smolka:
  A Foundation for Higher-order Concurrent Constraint Programming. CCL 1994: 50-72
• 
  Wayne Snyder:
  Automated Deduction with Constraints. CCL 1994: 1-2
• 
  Fujio Tsutsumi:
  An Efficient Algorithm of Logic Programming with Constraint Hierarchy. CCL 1994: 170-182
• 
  Tomás E. Uribe, Mark E. Stickel:
  Ordered Binary Decision Diagrams and the Davis-Putnam Procedure. CCL 1994: 34-49
• 
  Jean-Pierre Jouannaud:
  Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germany, September 7-9, 1994. Lecture Notes in Computer Science 845, Springer 1994, ISBN 3-540-58403-X [contents]