A Partial Taxonomy of Substitutability and Interchangeability

Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the different concepts, and indicate directions for future work, in particular with respect to making connections with research into symmetry breaking. This paper is a condensed version of a larger work in progress.Comment: 18 pages, The 10th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon'10

Some challenges for constraint programming

We propose a number of challenges for future constraint programming systems, including improvements in implementation technology (using global analysis based optimization and parallelism), debugging facilities, and the extensión of the application domain to distributed, global programming. We also briefly discuss how we are exploring techniques to meet these challenges in the context of the development of the CIAO constraint logic programming system

Franco-Japanese Research Collaboration on Constraint Programming

International audienceConstraint programming is an emergent technology that allows modeling and solving various problems in many areas such as artificial intelligence, computer programming, computer-aided design, computer graphics, and user interfaces. In this report, we provide recent activities of research collaboration on constraint programming conducted by the authors and other researchers in France and Japan. First, we outline our joint research projects on constraint programming, and then present the backgrounds, goals, and approaches of several research topics treated in the projects. Second, we describe the two Franco-Japanese Workshops on Constraint Programming (FJCP), which we organized in Japan in October 2004 and in France in November 2005. We conclude with future prospects for collaboration between French and Japanese researchers in this area

CLP-based protein fragment assembly

The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments are extracted by a preprocessor-also developed for this work- from a database of known protein structures that clusters and classifies the fragments according to similarity and frequency. The problem of assembling fragments into a complete conformation is mapped to a constraint solving problem and solved using CLP. The constraint-based model uses a medium discretization degree Ca-side chain centroid protein model that offers efficiency and a good approximation for space filling. The approach adapts existing energy models to the protein representation used and applies a large neighboring search strategy. The results shows the feasibility and efficiency of the method. The declarative nature of the solution allows to include future extensions, e.g., different size fragments for better accuracy.Comment: special issue dedicated to ICLP 201

Advanced periodic maintenance scheduling methods for aircraft lifecycle management

This paper reviews existing methods and techniques addressing the problem of maintenance support throughout the life cycle for high value manufacturing products such as aircrafts. As part of this doctorate research the analysis of current methods of maintenance scheduling was conducted. In order to contribute to a more comprehensive solution, an advanced approach (algorithm) of periodic maintenance is presented. The authors believe that this approach will reduce the cost of maintenance of high value manufacturing products. The algorithm based on constraint programming methods is briefly presented and the future research directions are discussed

Logic-Based Decision Support for Strategic Environmental Assessment

Strategic Environmental Assessment is a procedure aimed at introducing systematic assessment of the environmental effects of plans and programs. This procedure is based on the so-called coaxial matrices that define dependencies between plan activities (infrastructures, plants, resource extractions, buildings, etc.) and positive and negative environmental impacts, and dependencies between these impacts and environmental receptors. Up to now, this procedure is manually implemented by environmental experts for checking the environmental effects of a given plan or program, but it is never applied during the plan/program construction. A decision support system, based on a clear logic semantics, would be an invaluable tool not only in assessing a single, already defined plan, but also during the planning process in order to produce an optimized, environmentally assessed plan and to study possible alternative scenarios. We propose two logic-based approaches to the problem, one based on Constraint Logic Programming and one on Probabilistic Logic Programming that could be, in the future, conveniently merged to exploit the advantages of both. We test the proposed approaches on a real energy plan and we discuss their limitations and advantages.Comment: 17 pages, 1 figure, 26th Int'l. Conference on Logic Programming (ICLP'10

A hybrid approach to protein folding problem integrating constraint programming with local search

<p>Abstract</p> <p>Background</p> <p>The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search.</p> <p>Results</p> <p>Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach.</p> <p>Conclusion</p> <p>Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems.</p

A Constraint-directed Local Search Approach to Nurse Rostering Problems

In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iteratively. The success of the large neighbourhood search depends on the adequacy of this identified neighbourhood with regard to the problematic part of the solution assignment and the choice of the neighbourhood size. We investigate three strategies to choose the fragment of different sizes within the large neighbourhood search scheme. The first two strategies are tailored concerning the problem properties. The third strategy is more general, using the information of the cost from the soft constraint violations and their propagation as the indicator to choose the variables added into the fragment. The three strategies are analyzed and compared upon a benchmark nurse rostering problem. Promising results demonstrate the possibility of future work in the hybrid approach

Assessment of novel distributed control techniques to address network constraints with demand side management

The development of sustainable generation, a reliable electricity supply and affordable tariffs are the primary requirements to address the uncertainties in different future energy scenarios. Due to the predicted increase in Distributed Generation (DG) and load profile changes in future scenarios, there are significant operational and planning challenges facing netwrok operators. These changes in the power system distribution network require a new Active Network Management (ANM) control system to manage distribution constraint issues such as thermal rating, voltage, and fault levels. The future smart grid focuses on harnessing the control potential from demand side via bidirectional power flow, transparent information communication, and contractual customer participation. Demand Side Management (DSM) is considered as one of the effective solutions to defer network capacity reinforcement, increase energy efficiency, facilitate renewable access, and implement low carbon energy strategy. From the Distribution Network Operator's (DNO) perspective, the control opportunity from Demand Response (DR) and Decentralized Energy Resource (DER) contributes on capacity investment reduction, energy efficiency, and enable low carbon technologies. This thesis develops a new decentralized control system for dealing effectively with the constraint issues in the Medium Voltage (MV) distribution network. In the decentralized control system, two novel control approaches are proposed to autonomously relieve the network thermal constraint via DNO's direct control of the real power in network components during the operation period. The first approach, Demand Response for Power Flow Management (DR-PFM), implements the DSM peak clipping control of Active Demand (AD), whilst the second approach, Hybrid Control for Power Flow Management (HC-PFM), implements the hybrid control of both AD and DER. The novelty of these two new control algorithms consists in the application of a Constraint Satisfaction Problem (CSP) based programming model on decision making of the real power curtailment to relieve the network thermal overload. In the Constraint Programming (CP) model, three constraints are identified: a preference constraint, and a network constraint. The control approaches effectively solve the above constraint problem in the CSP model within 5 seconds' time response. The control performance is influenced by the pre-determined variable, domain and constraint settings. These novel control approaches take advantages on flexible control, fast response and demand participation enabling in the future smart grid.The development of sustainable generation, a reliable electricity supply and affordable tariffs are the primary requirements to address the uncertainties in different future energy scenarios. Due to the predicted increase in Distributed Generation (DG) and load profile changes in future scenarios, there are significant operational and planning challenges facing netwrok operators. These changes in the power system distribution network require a new Active Network Management (ANM) control system to manage distribution constraint issues such as thermal rating, voltage, and fault levels. The future smart grid focuses on harnessing the control potential from demand side via bidirectional power flow, transparent information communication, and contractual customer participation. Demand Side Management (DSM) is considered as one of the effective solutions to defer network capacity reinforcement, increase energy efficiency, facilitate renewable access, and implement low carbon energy strategy. From the Distribution Network Operator's (DNO) perspective, the control opportunity from Demand Response (DR) and Decentralized Energy Resource (DER) contributes on capacity investment reduction, energy efficiency, and enable low carbon technologies. This thesis develops a new decentralized control system for dealing effectively with the constraint issues in the Medium Voltage (MV) distribution network. In the decentralized control system, two novel control approaches are proposed to autonomously relieve the network thermal constraint via DNO's direct control of the real power in network components during the operation period. The first approach, Demand Response for Power Flow Management (DR-PFM), implements the DSM peak clipping control of Active Demand (AD), whilst the second approach, Hybrid Control for Power Flow Management (HC-PFM), implements the hybrid control of both AD and DER. The novelty of these two new control algorithms consists in the application of a Constraint Satisfaction Problem (CSP) based programming model on decision making of the real power curtailment to relieve the network thermal overload. In the Constraint Programming (CP) model, three constraints are identified: a preference constraint, and a network constraint. The control approaches effectively solve the above constraint problem in the CSP model within 5 seconds' time response. The control performance is influenced by the pre-determined variable, domain and constraint settings. These novel control approaches take advantages on flexible control, fast response and demand participation enabling in the future smart grid