A Framework for Decision-based Consistencies

International audienceConsistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most often, variable assignments) and stronger than (general- ized) arc consistency have been introduced. In this paper, our ambition is to present a clear picture of decision-based consistencies. We identify four general classes (or levels) of decision-based consistencies, denoted by S∆φ, E∆φ, B∆φ and D∆φ, study their relationships, and show that known consistencies are particular cases of these classes. Interestingly, this gen- eral framework provides us with a better insight into decision-based con- sistencies, and allows us to derive many new consistencies that can be directly integrated and compared with other ones

Four particle cluster approximation for the Maier-Saupe model of the isotropic-nematic phase transition

The cluster variation theory for the Maier-Saupe model of the isotropic-nematic phase transition is extended to the four-particle level. As in the case of the Heisenberg ferromagnet, the irregularities of the three-particle cluster approximation applied to cubic lattices, where there are no triangles of nearest neighbors, disappear. The extension from three- to four-particle clusters yields improved values of all quantities, characteristic for the phase transition

Interactively solving school timetabling problems using extensions of constraint programming

Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools. Although many approaches mainly based on local search or constraint programming seem to have been quite successful in recent years, they are often highly dedicated to specific problems and encounter difficulties to take the dynamic and over-constrained nature of such problems. We were confronted with such an over-constrained and dynamic problem in our institution. This paper deals with a timetabling system based on constraint programming with the use of explanations to offer a dynamic behaviour and to allow automatic relaxations of constraints. Our tool has successfully answered the needs of the current planner by providing solutions in a few minutes instead of a week of manual design.We present in this paper the techniques used, the results obtained and a discussion on the effects of the automation of the timetabling process

Kaon photoproduction: background contributions, form factors and missing resonances

The photoproduction p(gamma, K+)Lambda process is studied within a field-theoretic approach. It is shown that the background contributions constitute an important part of the reaction dynamics. We compare predictions obtained with three plausible techniques for dealing with these background contributions. It appears that the extracted resonance parameters drastically depend on the applied technique. We investigate the implications of the corrections to the functional form of the hadronic form factor in the contact term, recently suggested by Davidson and Workman (Phys. Rev. C 63, 025210). The role of background contributions and hadronic form factors for the identification of the quantum numbers of ``missing'' resonances is discussed.Comment: 11 pages, 7 eps figures, submitted to Phys. Rev.

Global Inverse Consistency for Interactive Constraint Satisfaction

International audienceSome applications require the interactive resolution of a constraint problem by a human user. In such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to solutions. We call this property global inverse consistency. Existing systems simulate this either by maintaining arc consistency after each assignment performed by the user or by compiling offline the problem as a multi-valued decision diagram. In this paper, we define several questions related to global inverse consistency and analyse their complexity. Despite their theoretical intractability, we propose several algorithms for enforcing global inverse consistency and we show that the best version is efficient enough to be used in an interactive setting on several configuration and design problems. We finally extend our contribution to the inverse consistency of tuples

Domain k-Wise Consistency Made as Simple as Generalized Arc Consistency

Abstract. In Constraint Programming (CP), Generalized Arc Consistency (GAC) is the central property used for making inferences when solving Constraint Satisfaction Problems (CSPs). Developing simple and practical filtering algorithms based on consistencies stronger than GAC is a challenge for the CP community. In this paper, we propose to combine k-Wise Consistency (kWC) with GAC, where kWC states that every tuple in a constraint can be extended to every set of k − 1 additional constraints. Our contribution is as follows. First, we derive a domain-filtering consistency, called Domain k-Wise Consistency (DkWC), from the combination of kWC and GAC. Roughly speaking, this property corresponds to the pruning of values of GAC, when enforced on a CSP previously made kWC. Second, we propose a procedure to enforce DkWC, relying on an encoding of kWC to generate a modified CSP called k-interleaved CSP. Formally, we prove that enforcing GAC on the k-interleaved CSP corresponds to enforcing DkWC on the initial CSP. Consequently, we show that the strong DkWC can be enforced very easily in constraint solvers since the k-interleaved CSP is rather immediate to generate and only existing GAC propagators are required: in a nutshell, DkWC is made as simple and practical as GAC. Our experimental results show the benefits of our approach on a variety of benchmarks.

Optimisation of pharmacy content in clinical cancer research protocols: Experience of the United Kingdom Chemotherapy and Pharmacy Advisory Service

Background: Clarity and accuracy of the pharmacy aspects of cancer clinical trial protocols is essential. Inconsistencies and ambiguities in such protocols have the potential to delay research and jeopardise both patient safety and collection of credible data. The Chemotherapy and Pharmacy Advisory Service was established by the UK National Cancer Research Network, currently known as National Institute for Health Research Clinical Research Network, to improve the quality of pharmacy-related content in cancer clinical research protocols. This article reports the scope of Chemotherapy and Pharmacy Advisory Service, its methodology of mandated protocol review and pharmacy-related guidance initiatives and its current impact. Methods: Over a 6-year period (2008–2013) since the inception of Chemotherapy and Pharmacy Advisory Service, cancer clinical trial protocols were reviewed by the service, prior to implementation at clinical trial sites. A customised Review Checklist was developed and used by a panel of experts to standardise the review process and report back queries and inconsistencies to chief investigators. Based on common queries, a Standard Protocol Template comprising specific guidance on drug-related content and a Pharmacy Manual Template were developed. In addition, a guidance framework was established to address ‘ad hoc’ pharmacy-related queries. The most common remarks made at protocol review have been summarised and categorised through retrospective analysis. In order to evaluate the impact of the service, chief investigators were asked to respond to queries made at protocol review and make appropriate changes to their protocols. Responses from chief investigators have been collated and acceptance rates determined. Results: A total of 176 protocols were reviewed. The median number of remarks per protocol was 26, of which 20 were deemed clinically relevant and mainly concerned the drug regimen, support medication, frequency and type of monitoring and drug supply aspects. Further analysis revealed that 62% of chief investigators responded to the review. All responses were positive with an overall acceptance rate of 89% of the proposed protocol changes. Conclusion: Review of pharmacy content of cancer clinical trial protocols is feasible and exposes many undetected clinically relevant issues that could hinder efficient trial conduct. Our service audit revealed that the majority of suggestions were effectively incorporated in the final protocols. The refinement of existing and development of new pharmacy-related guidance documents by Chemotherapy and Pharmacy Advisory Service might aid in better and safer clinical research