Independence in constraint logic programs

Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons. First, because interaction between variables through constraints is more complex than in the case of logic programming. Second, in order to ensure the efUciency of several optimizations not only must independence of the search space be considered, but also an orthogonal issue - "independence of constraint solving." We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow different independence-related optimizations, from parallelism to intelligent backtracking. Sufficient conditions for independence which can be evaluated "a-priori" at run-time are also proposed. Our results suggest that independence, provided a suitable definition is chosen, is even more useful in CLP than in LP

Predictive validity of the Short-Term Assessment of Risk and Treatability (START) for multiple adverse outcomes:the effect of diagnosis

The Short-Term Assessment of Risk and Treatability (START) assists risk assessment for seven risk outcomes based on scoring of risk and protective factors and assignment of clinically-informed risk levels. Its predictive validity for violence and self-harm has been established in males with schizophrenia, but accuracy across pathologically diverse samples is unknown. Routine START assessments and 3-month risk outcome data of N = 527 adult, inpatients in a UK secure mental health facility were collected. The sample was divided into diagnostic groups; predictive validity was established using receiver operating characteristics regression (rocreg) analysis in which potential covariates were controlled. In most single-diagnosis groups START risk factors ('vulnerabilities'), protective factors ('strengths'), and clinically-informed estimates predicted multiple risk outcomes with effect sizes similar to previous research. Self-harm was not predicted among patients with an organic diagnosis. The START risk estimates predicted physical aggression in all diagnostic groups, and verbal aggression, self-harm and self-neglect in most diagnostic groups. The START can assist assessment of aggressive, self-harm, and self-neglect across a range of diagnostic groups. Further research with larger sample sizes of those with multiple diagnoses is required.</p

A Computational Interpretation of Context-Free Expressions

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression

Analyzing logic programs with dynamic scheduling

Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in which some calis are dynamically "delayed" until their arguments are sufRciently instantiated to allow the cali to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling

The identification of markers of macrophage differentiation in PMA-stimulated THP-1 Cells and monocyte-derived macrophages

Differentiated macrophages are the resident tissue phagocytes and sentinel cells of the innate immune response. The phenotype of mature tissue macrophages represents the composite of environmental and differentiation-dependent imprinting. Phorbol-12-myristate-13-acetate (PMA) and 1,25-dihydroxyvitamin D3 (VD3) are stimuli commonly used to induce macrophage differentiation in monocytic cell lines but the extent of differentiation in comparison to primary tissue macrophages is unclear. We have compared the phenotype of the promonocytic THP-1 cell line after various protocols of differentiation utilising VD3 and PMA in comparison to primary human monocytes or monocyte-derived macrophages (MDM). Both stimuli induced changes in cell morphology indicative of differentiation but neither showed differentiation comparable to MDM. In contrast, PMA treatment followed by 5 days resting in culture without PMA (PMAr) increased cytoplasmic to nuclear ratio, increased mitochondrial and lysosomal numbers and altered differentiation-dependent cell surface markers in a pattern similar to MDM. Moreover, PMAr cells showed relative resistance to apoptotic stimuli and maintained levels of the differentiation-dependent anti-apoptotic protein Mcl-1 similar to MDM. PMAr cells retained a high phagocytic capacity for latex beads, and expressed a cytokine profile that resembled MDM in response to TLR ligands, in particular with marked TLR2 responses. Moreover, both MDM and PMAr retained marked plasticity to stimulus-directed polarization. These findings suggest a modified PMA differentiation protocol can enhance macrophage differentiation of THP-1 cells and identify increased numbers of mitochondria and lysosomes, resistance to apoptosis and the potency of TLR2 responses as important discriminators of the level of macrophage differentiation for transformed cells

Finding a Mate With No Social Skills

Sexual reproductive behavior has a necessary social coordination component as willing and capable partners must both be in the right place at the right time. While there are many known social behavioral adaptations to support solutions to this problem, we explore the possibility and likelihood of solutions that rely only on non-social mechanisms. We find three kinds of social organization that help solve this social coordination problem (herding, assortative mating, and natal philopatry) emerge in populations of simulated agents with no social mechanisms available to support these organizations. We conclude that the non-social origins of these social organizations around sexual reproduction may provide the environment for the development of social solutions to the same and different problems.Comment: 8 pages, 5 figures, GECCO'1

Independence and search space preservation in dynamically scheduled constraint logic languages

This paper performs a further generalization of the notion of independence in constraint logic programs to the context of constraint logic programs with dynamic scheduling. The complexity of this new environment made necessary to first formally define the relationship between independence and search space preservation in the context of CLP languages. In particular, we show that search space preservation is, in the context of CLP languages, not only a sufficient but also a necessary condition for ensuring that both the intended solutions and the number of transitions performed do not change. These results are then extended to dynamically scheduled languages and used as the basis for the extension of the concepts of independence. We also propose several a priori sufficient conditions for independence and also give correctness and efficiency results for parallel execution of constraint logic programs based on the proposed notions of independence

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution

Social cognition in intellectually disabled male criminal offenders: a deficit in affect perception?

Purpose: Although intellectual disability (ID) and criminal offending have long been associated, the nature of this link is obfuscated by reliance on weak, historical means of assessing ID and fractionating social cognitive skills. This paper addresses current and future research in social perception, social inference and social problem-solving in ID violent offenders. Methodology: Literature is reviewed on comorbidity of criminal offending and ID, and on social problem-solving impairment and offending. In an exploratory case-control series comprising six violent offenders with ID and five similarly able controls, emotion recognition and social inference are assessed by the Awareness of Social Inference Test (TASIT) and social problem-solving ability and style by an adapted Social Problem-Solving Inventory (SPSI-R). Findings: Violent offenders recognised all emotions except ‘anxious’, which they tended to misidentify as ‘surprise’. While offenders could interpret and integrate wider contextual cues, absent such cues offenders were less able to use paralinguistic cues (e.g. emotional tone) to infer speakers' feelings. Offenders in this sample exceeded controls' social problem-solving scores. Value: ID offenders, like neurotypical offenders, display specific deficits in emotion recognition- particularly fear recognition. Concurrently, enhanced social problem solving (at least as measured by the SPSI-R) in offenders is a novel preliminary finding which requires follow-up in a larger sample. Findings are discussed within the social processing framework, highlighting the need for tighter service-user baseline measures and further research into the causes of ID offending