Book One
Short Papers
Long Papers
Tightened Transitive Closure of Integer Addition Constraints
Some Interval Approximation Techniques for MINLP
Rewriting Constraint Models with Metamodels
Reformulating Planning Problems by Eliminating Unpromising Actions
Ontology-Based Link Prediction in the LiveJournal Social Network
Modelling Equidistant Frequency Permutation Arrays in Constraints
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
Light Algorithms for Maintaining Max-RPC During Search
Integrating Constraint Models for Sequential and Partial-Order Planning
Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases
In Search of a Better Method to Break Row and Column Symmetries
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints
A Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis
Confluence of Reduction Rules for Lexicographic Ordering Constraints
Common Subexpressions in Constraint Models of Planning Problems
Cluster Graphs as Abstractions for Constraint Satisfaction Problems
Automatically Enhancing Constraint Model Instances during Tailoring
Automated Redesign with the General Redesign Engine
Abstraction-Based Heuristics with True Distance Computations
Abstract Planning with Unknown Object Quantities and Properties
Abductive Problem Solving with Abstractions
A Practical Use of Imperfect Recall
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances