6. CP 2000:
Singapore
Rina Dechter (Ed.):
Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings.
Lecture Notes in Computer Science 1894 Springer 2000, ISBN 3-540-41053-8
Invited Papers
Regular Papers
- Slim Abdennadher, Christophe Rigotti:
Automatic Generation of Propagation Rules for Finite Domains.
18-34

- Fahiem Bacchus:
Extending Forward Checking.
35-51

- Nicolas Beldiceanu:
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type.
52-66

- Frédéric Benhamou, Frédéric Goualard:
Universally Quantified Interval Constraints.
67-82

- Stefano Bistarelli, Rosella Gennari, Francesca Rossi:
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions.
83-97

- Alexander Brodsky, Csilla Farkas, Duminda Wijesekera, Xiaoyang Sean Wang:
Constraints, Inference Channels and Secure Databases.
98-113

- Mathias Broxvall, Peter Jonsson, Jochen Renz:
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints.
114-127

- Jean Carrive, Pierre Roy, François Pachet, Rémi Ronfard:
A Language for Audiovisual Template Specification and Recognition.
128-142

- Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel Aguirre, Devika Subramanian, Moshe Y. Vardi:
Random 3-SAT: The Plot Thickens.
143-159

- David A. Cohen, Peter Jeavons, Richard Gault:
New Tractable Classes from Old.
160-171

- Alain Colmerauer, Thi-Bich-Hanh Dao:
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees.
172-186

- Filippo Focacci, Andrea Lodi, Michela Milano:
Cutting Planes in Constraint Programming: A Hybrid Approach.
187-201

- Vineet Gupta, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Xiaowei Jiang, Konstantin Läufer:
A Constraint-Based Framework for Prototyping Distributed Virtual Applications.
202-217

- Hiroshi Hosobe:
A Scalable Linear Constraint Solver for User Interface Construction.
218-232

- Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, Michel Rueher:
A Constraint Programming Approach for Solving Rigid Geometric Systems.
233-248

- Narendra Jussien, Romuald Debruyne, Patrice Boizumault:
Maintaining Arc-Consistency within Dynamic Backtracking.
249-261

- Kalev Kask:
New Search Heuristics for Max-CSP.
262-277

- Bhaskar Krishnamachari, Xi Xie, Bart Selman, Stephen B. Wicker:
Analysis of Random Noise and Random Walk Algorithms.
278-290

- Javier Larrosa:
Boosting Search with Variable Elimination.
291-305

- Kurt Mehlhorn, Sven Thiel:
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint.
306-319

- Tobias Müller:
Practical Investigation of Constraints with Graph Views.
320-336

- Steven David Prestwich:
A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences.
337-352

- Patrick Prosser, Kostas Stergiou, Toby Walsh:
Singleton Consistencies.
353-368

- Philippe Refalo:
Linear Formulation of Constraint Programming Models and Hybrid Solvers.
369-383

- Jean-Charles Régin, Michel Rueher:
A Global Constraint Combining a Sum Constraint and Difference Constraints.
384-395

- Peter Z. Revesz, Mengchu Cai:
Efficient Querying of Periodic Spatiotemporal Objects.
396-410

- Thomas Schiex:
Arc Consistency for Soft Constraints.
411-424

- Benjamin W. Wah, Yixin Chen:
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization.
425-440

- Toby Walsh:
SAT v CSP.
441-456

- Hui Wu, Joxan Jaffar, Roland H. C. Yap:
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies.
457-469

- Yuanlin Zhang, Roland H. C. Yap:
Arc Consistency on n-ary Monotonic and Linear Constraints.
470-483

Poster Papers
- Ola Angelsmark, Peter Jonsson:
Some Observations on Durations, Scheduling and Allen's Algebra.
484-488

- Luís Baptista, João P. Marques Silva:
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability.
489-494

- Renato Bruni, Antonio Sassano:
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
495-499

- David W. Fowler, Kenneth N. Brown:
Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes.
500-504

- Laurent Granvilliers, Eric Monfroy:
Constraint Propagation: Between Abstract Models and ad hoc Strategies.
505-509

- Markus Hannebauer:
How to Model and Verify Concurrent Algorithms for Distributed CSPs.
510-514

- Katsutoshi Hirayama, Makoto Yokoo, Katia P. Sycara:
The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results.
515-519

- Petra Hofstedt:
Cooperating Constraint Solvers.
520-524

- Michael C. Horsch, William S. Havens:
An Empirical Study of Probabilistic Arc Consistency.
525-530

- Sivakumar Nagarajan, Scott D. Goodwin, Abdul Sattar, John Thornton:
On Dual Encodings for Non-binary Constraint Satisfaction Problems.
531-536

- João P. Marques Silva:
Algebraic Simplification Techniques for Propositional Satisfiability.
537-542

- Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-Francois Puget:
An Original Constraint Based Approach for Solving over Constrained Problems.
543-548

- Yuko Sakurai, Makoto Yokoo, Koji Kamei:
An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions.
549-553

Last update Sat May 25 17:40:19 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page