2. CP 1996: Cambridge, Massachusetts

@proceedings{DBLP:conf/cp/1996,
  editor    = {Eugene C. Freuder},
  title     = {Proceedings of the Second International Conference on Principles
               and Practice of Constraint Programming, Cambridge, Massachusetts,
               USA, August 19-22, 1996},
  booktitle = {CP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1118},
  year      = {1996},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Papers

• Slim Abdennadher, Thom W. Frühwirth, Holger Meuss:
  On Confluence of Constraint Handling Rules. 1-15
  
• Mohamed-Salah Affane, Hachemi Bennaceur:
  A Labelling Arc Consistency Method for Functional Constraints. 16-30
  
• Dhritiman Banerjee, Jeremy Frank:
  Constraint Satisfaction in Optical Routing for Passive Wavelength-Routed Networks. 31-45
  
• Roberto J. Bayardo Jr., Robert Schrag:
  Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances. 46-60
  
• Christian Bessière, Jean-Charles Régin:
  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. 61-75
  
• Witold Charatonik, Andreas Podelski:
  The Independence Property of a Class of Set Constraints. 76-90
  
• B. M. W. Cheng, Jimmy Ho-Man Lee, J. C. K. Wu:
  Speeding Up Constraint Propagation By Redundant Modeling. 91-103
  
• C. K. Chiu, C. M. Chou, Jimmy Ho-Man Lee, Ho-fung Leung, Y. W. Leung:
  A Constraint-Based Interactive Train Rescheduling Tool. 104-118
  
• David A. Clark, Jeremy Frank, Ian P. Gent, Ewan MacIntyre, Neven Tomov, Toby Walsh:
  Local Search and the Number of Solutions. 119-133
  
• David A. Cohen, Marc Gyssens, Peter Jeavons:
  Derivation of Constraints and Database Relations. 134-148
  
• Yves Colombani:
  Constraint Programming: an Efficient and Practical Approach to Solving the Job-Shop Problem. 149-163
  
• Hani El Sakkout, Mark Wallace, Barry Richards:
  An Instance of Adaptive Constraint Propagation. 164-178
  
• Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. 179-193
  
• Jin-Kao Hao, Raphaël Dorne:
  Empirical Studies of Heuristic Local Search for Constraint Solving. 194-208
  
• Christian Holzbaur, Francisco Menezes, Pedro Barahona:
  Defeasibility in CLP(Q) through Generalized Slack Variables. 209-223
  
• John N. Hooker:
  Inference Duality as a Basis for Secitivity Analysis. 224-236
  
• Hiroshi Hosobe, Satoshi Matsuoka, Akinori Yonezawa:
  Generalized Local Propagation: A Framework for Solving Constraint Hierarchies. 237-251
  
• Michael Jampel, Jean-Marie Jacquet, David Gilbert, Sebastian Hunt:
  Transformations Between HCLP and PCSP. 252-266
  
• Peter Jeavons, David A. Cohen, Marc Gyssens:
  A test for Tractability. 267-281
  
• Stephan Kepser, Klaus U. Schulz:
  Combination of Constraint Systems II: Rational Amalgamation. 282-296
  
• Manolis Koubarakis:
  Tractable Disjunctions of Linear Constraints. 297-307
  
• Javier Larrosa, Pedro Meseguer:
  Exploiting the Use of DAC in MAX-CSP. 308-322
  
• Hoong Chuin Lau:
  A New Approach for Weighted Constraint Satisfaction: Theoretical and Computational Results. 323-337
  
• Jimmy Ho-Man Lee, Ho-fung Leung, Hon-Wing Won:
  Towards a More Efficient Stochastic Constraint Solver. 338-352
  
• Gilles Pesant, Michel Gendreau:
  A View of Local Search in Constraint Programming. 353-366
  
• María Cristina Riff Rojas:
  From Quasi-Solutions to Solution: An Evolutionary Algorithm to Solve CSP. 367-381
  
• Francesca Rossi:
  Existential Variables and Local Consistency in Finite Domain Constraint Problems. 382-396
  
• Paul Ruet:
  Logical Semantics of Concurrent Constraint Programming. 397-409
  
• Djamila Sam-Haroud, Boi Faltings:
  Solving Non-binary Convez CSPs in Continous Domains. 410-424
  
• Tetsuya Suzuki, Nobuo Kakinuma, Takehiro Tokuda:
  An Eperimental Comparison of Three Modified DeltaBlue Algorithms. 425-435
  
• Cesare Tinelli, Mehdi T. Harandi:
  Constraint Logic Programming over Unions of Constraint Theories. 436-450
  
• Luis Urbina:
  Analysis of Hybrid Systems in CLP(R). 451-467
  
• Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht:
  On Query Languages for Linear Queries Definable with Polynomial Constraints. 468-481
  
• Richard J. Wallace:
  Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. 482-496
  
• Makoto Yokoo, Takayuki Suyama, Hiroshi Sawada:
  Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results. 497-509
  
• Jianyang Zhou:
  A Constraint Program for Solving the Job-Shop Problem. 510-524
  

Posters

• Patrick Albers, Jacques Bellone:
  PSAP - A Planning System for Aircraft Production (Extended Abstract). 525-526
  
• Steven A. Battle:
  Using Partial Arc Consistency in a Database Environment. 527-528
  
• Mouhssine Bouzoubaa:
  Functional Constrain Hierarchies in CLP. 529-530
  
• Mats Carlsson, Björn Carlson, Greger Ottosson:
  Towards an Open Finite Domain Constraint Solver. 531-532
  
• Assef Chmeiss, Philippe Jégou:
  Efficient Constraint Propagation With Good Space Complexity. 533-534
  
• Mukesh Dalal, Yong Feng:
  Anytime Temporal Reasoning: Preliminary Report (Extended Abstract). 535-536
  
• François Fages:
  From Constraint Minimization to Goal Optimization in CLP Languages. 537-538
  
• Daniel Frost, Rina Dechter:
  Looking at Full Looking Ahead. 539-540
  
• Stuart A. Grant, Barbara M. Smith:
  The Arc and Path Consistency Phase Transitions. 541-542
  
• Wim Hellinck:
  Experiences with Combining Constraint Programming and Discrete Event Simulation. 543-544
  
• Katsutoshi Hirayama:
  Hill-Climbing with Local Consistency for Solving Distributed CSPs. 545-546
  
• F. J. Jüngen, W. Kowalczyk:
  Appriximate Algorithms for Maximum Utility Problems. 547-548
  
• Evelina Lamma, Paola Mello, Michela Milano:
  A Meta Constraint Logic Programming Architecture (Extended Abstract). 549-550
  
• Pierre-Paul Mérel, Zineb Habbas, Francine Herrmann, Daniel Singer:
  N-Ary Consistencies and Constraint-Based Backtracking. 551-552
  
• Stéphane N'Dong, Michel Van Caneghem:
  Global Behaviour for Complex Constraints. 553-554
  
• Irina Rish, Rina Dechter:
  To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). 555-556
  
• Vincent Schächter:
  A Local Simplification Scheme for cc Programs. 557-558
  
• Gadi Solotorevsky:
  From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs. 559-560
  
• Gadi Solotorevsky, Ehud Gudes, Amnon Meisels:
  Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs). 561-562
  
• Douglas R. Smith, Stephen J. Westfold:
  Scheduling an Asynchronously Shared Resource. 563-564
  
• Luis Urbina:
  The Generalized Railroad Crossing: Its Symbolic Analysis in CLP(R). 565-567
  
• Jason H. Y. Wong, Kai-fai Ng, Ho-Fung Leung:
  A Stochastic Approach to Solving Fuzzy Constraint Satisfaction Problems. 568-569
  

Invited Lecture

• George L. Nemhauser:
  Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract). 570
  

Lectures in Honor of Paris C. Kanellakis

• Dina Q. Goldin:
  Constraint Databases. 571
  
• Harry G. Mairson:
  Complexity-Theoretic Aspects for Programming Language Design. 572
  

Last update Mon Feb 13 04:22:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page