Front matter
1-10
Constraint-Based Agents: The ABC’s of CBA’s
Alan K. Mackworth
11-12
Constraints for Interactive Graphical Applications
Alan Borning
13-17
Meta-complexity Theorems: Talk Abstract
David McAllester
18-34
Automatic Generation of Propagation Rules for Finite Domains
Slim Abdennadher and Christophe Rigotti
35-51
Extending Forward Checking
Fahiem Bacchus
52-66
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
Nicolas Beldiceanu
67-82
Universally Quantified Interval Constraints
Frédéric Benhamou and Frédéric Goualard
83-97
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
S. Bistarelli, R. Gennari and F. Rossi
98-113
Constraints Inference Channels and Secure Databases
Alexander Brodsky, Csilla Farkas, Duminda Wijesekera and X. Sean Wang
114-127
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
Mathias Broxvall, Peter Jonsson and Jochen Renz
128-142
A Language for Audiovisual Template Specification and Recognition
Jean Carrive, Pierre Roy, François Pachet and Rémi Ronfard
143-159
Random 3-SAT: The Plot Thickens
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso San Miguel Aguirre, Devika Subramanian and Moshe Y. Vardi
160-171
New Tractable Classes from Old
David Cohen, Peter Jeavons and Richard Gault
172-186
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
Alain Colmerauer and Thi-Bich-Hanh Dao
187-201
Cutting Planes in Constraint Programming: An Hybrid Approach
Filippo Focacci, Andrea Lodi and Michela Milano
202-218
A Constraint-Based Framework for Prototyping Distributed Virtual Applications
Vineet Gupta, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Xiaowei Jiang and Konstantin Läufer
218-233
A Scalable Linear Constraint Solver for User Interface Construction
Hiroshi Hosobe
233-248
A Constraint Programming Approach for Solving Rigid Geometric Systems
Christophe Jermann, Gilles Trombettoni, Bertrand Neveu and Michel Rueher
249-261
Maintaining Arc-Consistency within Dynamic Backtracking
Narendra Jussien, Romuald Debruyne and Patrice Boizumault
262-277
New Search Heuristics for Max-CSP
Kalev Kask
278-290
Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing
Bhaskar Krishnamachari, Xi Xie, Bart Selman and Stephen Wicker
291-305
Boosting Search with Variable Elimination
Javier Larrosa
306-319
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
Kurt Mehlhorn and Sven Thiel
320-336
Practical Investigation of Constraints with Graph Views
Tobias Müller
337-352
A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
Steven Prestwich
353-368
Singleton Consistencies
Patrick Prosser, Kostas Stergiou and Toby Walsh
369-383
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Philippe Refalo
384-395
A Global Constraint Combining a Sum Constraint and Difference Constraints
Jean-Charles Régin and Michel Rueher
396-410
Efficient Querying of Periodic Spatiotemporal Objects
Peter Revesz and Mengchu Cai
411-425
Arc Consistency for Soft Constraints
Thomas Schiex
425-440
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Benjamin W. Wah and Yi Xin Chen
441-456
SAT
v
CSP
Toby Walsh
457-469
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
Hui Wu, Joxan Jaffar and Roland Yap
470-483
Arc Consistency on
n
-ary Monotonic and Linear Constraints
Zhang Yuanlin and Roland H. C. Yap
484-489
Some Observations on Durations, Scheduling and Allen’s Algebra
Ola Angelsmark and Peter Jonsson
489-494
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
Luís Baptista and João Marques-Silva
495-499
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances
Renato Bruni and Antonio Sassano
500-504
Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
David W. Fowler and Kenneth N. Brown
505-509
Constraint Propagation: Between Abstract Models and ad hoc Strategies
Laurent Granvilliers and Eric Monfroy
510-514
How to Model and Verify Concurrent Algorithms for Distributed CSPs
Markus Hannebauer
515-519
The Phase Transition in Distributed Constraint Satisfaction Problems: First Results
Katsutoshi Hirayama, Makoto Yokoo and Katia Sycara
520-525
Cooperating Constraint Solvers
Petra Hofstedt
525-530
An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic
Michael C. Horsch and William S. Havens
531-536
On Dual Encodings for Non-binary Constraint Satisfaction Problems
S. Nagarajan, S. Goodwin, A. Sattar and J. Thornton
537-542
Algebraic Simplification Techniques for Propositional Satisfiability
João Marques-Silva
543-548
An Original Constraint Based Approach for Solving over Constrained Problems
J. -C. Régin, T. Petit, C. Bessière and J. -F. Puget
549-553
An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
Yuko Sakurai, Makoto Yokoo and Koji Kamei
Back matter