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

• 1997
• 
  Slim Abdennadher:
  Operational Semantics and Confluence of Constraint Propagation Rules. CP 1997: 252-266
• 
  Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou:
  Random Constraint Satisfaction: A More Accurate Picture. CP 1997: 107-120
• 
  Philippe Baptiste, Claude Le Pape:
  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP 1997: 375-389
• 
  J. Christopher Beck, Andrew J. Davenport, Mark S. Fox:
  Five Pitfalls of Empirical Scheduling Research. CP 1997: 390-404
• 
  Claudio Bettini, Xiaoyang Sean Wang, Sushil Jajodia:
  Satisfiability of Quantitative Temporal Constraints with Multiple Granularities. CP 1997: 435-449
• 
  Noëlle Bleuzen-Guernalec, Alain Colmerauer:
  Narrowing a Block of Sortings in Quadratic Time. CP 1997: 2-16
• 
  Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo:
  Semantics and Expressive Power of a Timed Concurrent Constraint Language. CP 1997: 47-61
• 
  Alexandre Boudet, Evelyne Contejean:
  AC-Unification of Higher-Order Patterns. CP 1997: 267-281
• 
  Yves Caseau:
  Using Constraint Propagation for Complex Scheduling Problems: Managing Size, Complex Resources and Travel. CP 1997: 163-166
• 
  Yves Caseau, François Laburthe:
  Solving Various Weighted Matching Problems with Constraints. CP 1997: 17-31
• 
  David A. Cohen, Peter Jeavons, Manolis Koubarakis:
  Tractable Disjunctive Constraints. CP 1997: 478-490
• 
  Romuald Debruyne, Christian Bessière:
  From Restricted Path Consistency to Max-Restricted Path Consistency. CP 1997: 312-326
• 
  Philippe Devienne, Jean-Marc Talbot, Sophie Tison:
  Solving Classes of Set Constraints with Tree Automata. CP 1997: 62-76
• 
  Philippe Galinier, Jin-Kao Hao:
  Tabu Search for Maximal Constraint Satisfaction Problems. CP 1997: 196-208
• 
  Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
  The Constrainedness of Arc Consistency. CP 1997: 327-340
• 
  Ian P. Gent, Judith L. Underwood:
  The Logic of Search Algorithms: Theory and Applications. CP 1997: 77-91
• 
  Simon de Givry, Gérard Verfaillie, Thomas Schiex:
  Bounding the Optimum of Constraint Optimization Problems. CP 1997: 405-419
• 
  Carla P. Gomes, Bart Selman, Nuno Crato:
  Heavy-Tailed Distributions in Combinatorial Search. CP 1997: 121-135
• 
  Stéphane Grumbach, Gabriel M. Kuper:
  Tractable Recursion over Geometric Data. CP 1997: 450-462
• 
  Youssef Hamadi, David Merceron:
  Reconfigurable Architectures: A New Vision for Optimization Problems. CP 1997: 209-221
• 
  Warwick Harvey, Peter J. Stuckey, Alan Borning:
  Compiling Constraint Solving using Projection. CP 1997: 491-505
• 
  Pascal Van Hentenryck:
  A Modeling Language for Constraint Programming. CP 1997: 1
• 
  Miki Hermann, Phokion G. Kolaitis:
  On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997: 282-296
• 
  Katsutoshi Hirayama, Makoto Yokoo:
  Distributed Partial Constraint Satisfaction Problem. CP 1997: 222-236
• 
  Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam:
  Finding Solvable Subsets of Constraint Graphs. CP 1997: 463-477
• 
  Gabriel Istrate:
  Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems. CP 1997: 136-149
• 
  Jean-Marc Labat, Laurent Mynard:
  Oscillation, Heuristic Ordering and Pruning in Neighborhood Search. CP 1997: 506-518
• 
  Chu Min Li, Anbulagan:
  Look-Ahead Versus Look-Back for Satisfiability Problems. CP 1997: 341-355
• 
  Stephan Melzer:
  Verification of Parallel Systems using Constraint Programming. CP 1997: 92-106
• 
  Laurent Michel, Pascal Van Hentenryck:
  Localizer: A Modeling Language for Local Search. CP 1997: 237-251

skipping 13 more matches