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

p16 mutations/deletions are not frequent events in prostate cancer.

Cyclin-dependent kinase-4 inhibitor gene (p16INK4) has recently been mapped to chromosome 9p21. Homozygous deletions of this gene have been found at high frequency in cell lines derived from different types of tumours. These findings suggested therefore, that p16INK4 is a tumour-suppressor gene involved in a wide variety of human cancers. To investigate the frequency of p16INK mutations/deletions in prostate cancer, we screened 20 primary prostate tumours and four established cell lines by polymerase chain reaction (PCR) and single-strand conformation polymorphism (SSCP) analysis for exon 1 and exon 2. In contrast to most previous reports, no homozygous deletions were found in prostate cancer cell lines, but one cell line (DU145) has revealed to a mutation at codon 76. Only two SSCP shifts were detected in primary tumours: one of them corresponds to a mutation at codon 55 and the other one probably corresponds to a polymorphism. These data suggest that mutation of the p16INK4 gene is not a frequent genetic alteration implicated in prostate cancer development

Nuclear transparencies in relativistic A(e,e'p) models

Relativistic and unfactorized calculations for the nuclear transparency extracted from exclusive A(e,e'p) reactions for 0.3 \leq Q^2 \leq 10 (GeV/c)^2 are presented for the target nuclei C, Si, Fe and Pb. For Q^2 \geq 0.6 (GeV/c)^2, the transparency results are computed within the framework of the recently developed relativistic multiple-scattering Glauber approximation (RMSGA). The target-mass and Q^2 dependence of the RMSGA predictions are compared with relativistic distorted-wave impulse approximation (RDWIA) calculations. Despite the very different model assumptions underlying the treatment of the final-state interactions in the RMSGA and RDWIA frameworks, they predict comparable nuclear transparencies for kinematic regimes where both models are applicable.Comment: 15 pages, 4 figure

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.

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