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