| 1997 | Narrowing a Block of Sortings in Quadratic Time. | Nolle Bleuzen-Guernalec, Alain Colmerauer |
| 1997 | Satisfiability of Quantitative Temporal Constraints with Multiple Granularities. | Claudio Bettini, Xiaoyang Sean Wang, Sushil Jajodia |
| 1997 | Five Pitfalls of Empirical Scheduling Research. | J. Christopher Beck, Andrew J. Davenport, Mark S. Fox |
| 1997 | Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. | Philippe Baptiste, Claude Le Pape |
| 1997 | Random Constraint Satisfaction: A More Accurate Picture. | Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou |
| 1997 | Operational Semantics and Confluence of Constraint Propagation Rules. | Slim Abdennadher |
| 1996 | A Constraint Program for Solving the Job-Shop Problem. | Jianyang Zhou |
| 1996 | Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results. | Makoto Yokoo, Takayuki Suyama, Hiroshi Sawada |
| 1996 | A Stochastic Approach to Solving Fuzzy Constraint Satisfaction Problems. | Jason H. Y. Wong, Kai-Fai Ng, Ho-fung Leung |
| 1996 | Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. | Richard J. Wallace |
| 1996 | On Query Languages for Linear Queries Definable with Polynomial Constraints. | Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht |
| 1996 | The Generalized Railroad Crossing: Its Symbolic Analysis in CLP(R). | Luis Urbina |
| 1996 | Analysis of Hybrid Systems in CLP(R). | Luis Urbina |
| 1996 | Constraint Logic Programming over Unions of Constraint Theories. | Cesare Tinelli, Mehdi T. Harandi |
| 1996 | An Eperimental Comparison of Three Modified DeltaBlue Algorithms. | Tetsuya Suzuki, Nobuo Kakinuma, Takehiro Tokuda |
| 1996 | Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs). | Gadi Solotorevsky, Ehud Gudes, Amnon Meisels |
| 1996 | From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs. | Gadi Solotorevsky |
| 1996 | Scheduling an Asynchronously Shared Resource. | Douglas R. Smith, Stephen J. Westfold |
| 1996 | A Local Simplification Scheme for cc Programs. | Vincent Schchter |
| 1996 | Solving Non-binary Convez CSPs in Continous Domains. | Djamila Sam-Haroud, Boi Faltings |
| 1996 | An Instance of Adaptive Constraint Propagation. | Hani El Sakkout, Mark Wallace, Barry Richards |
| 1996 | Logical Semantics of Concurrent Constraint Programming. | Paul Ruet |
| 1996 | Existential Variables and Local Consistency in Finite Domain Constraint Problems. | Francesca Rossi |
| 1996 | From Quasi-Solutions to Solution: An Evolutionary Algorithm to Solve CSP. | Mara Cristina Riff Rojas |
| 1996 | To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). | Irina Rish, Rina Dechter |