Efficient Groundness Analysis in Prolog

Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, a variety of issues pertaining to the efficient Prolog implementation of groundness analysis are investigated, focusing on the domain of definite Boolean functions, Def. The systematic design of the representation of an abstract domain is discussed in relation to its impact on the algorithmic complexity of the domain operations; the most frequently called operations should be the most lightweight. This methodology is applied to Def, resulting in a new representation, together with new algorithms for its domain operations utilising previously unexploited properties of Def -- for instance, quadratic-time entailment checking. The iteration strategy driving the analysis is also discussed and a simple, but very effective, optimisation of induced magic is described. The analysis can be implemented straightforwardly in Prolog and the use of a non-ground representation results in an efficient, scalable tool which does not require widening to be invoked, even on the largest benchmarks. An extensive experimental evaluation is givenComment: 31 pages To appear in Theory and Practice of Logic Programmin

A Semantic Basis for Specialising Domain Constraints

This paper formalises an analysis of finite domain programs and the resultant program transformation. The analysis adds low valency (domain) constraints to clauses in order to reduce search. The technique is outlined with a worked example and then formalised using abstract interpretation. Correctness of the analysis and of the transformation is proved

Three Optimisations for Sharing

In order to improve precision and efficiency sharing analysis should track both freeness and linearity. The abstract unification algorithms for these combined domains are suboptimal, hence there is scope for improving precision. This paper proposes three optimisations for tracing sharing in combination with freeness and linearity. A novel connection between equations and sharing abstractions is used to establish correctness of these optimisations even in the presence of rational trees. A method for pruning intermediate sharing abstractions to improve efficiency is also proposed. The optimisations are lightweight and therefore some, if not all, of these optimisations will be of interest to the implementor.Comment: To appear in Theiry and Practice of Logic Programmin

A Pearl on SAT Solving in Prolog (Logic Programming Newsletter)

Extended abstract for Association of Logic Programming (ALP) Newsletter on FLOPS/TCS special issue paper on SAT and SMT solving in Prolog

Money Matters: Factors Associated with Receipt of Financial Aid Among Youth Who have Experienced Foster Care

Despite high aspirations, youth formerly in foster care may face significant barriers (e.g., academic preparedness, adult mentoring) to obtaining a postsecondary credential. Better understanding the relationship between affordability and postsecondary access for youth formerly in foster care (YFFC) merits attention from researchers because finances often present a barrier to success for this population of students. This exploratory study asks the question: What factors influenced whether YFFC received financial aid and do those factors change over time? Using event history analysis and national longitudinal on foster care and youth outcomes, we explore what factors impact whether a YFFC receives financial aid

Temperature-Dependent Polarized Raman Spectra of CaFe2O4

The Raman spectra of CaFe2O4 were measured with several exact scattering configurations between 20 and 520K and the symmetry of all observed Raman lines was determined. The Ag and B2g lines were assigned to definite phonon modes by comparison to the results of lattice dynamical calculations. No anomaly of phonon parameters was observed near the magnetic ordering temperature TN = 160K.Comment: 4 pages, 1 table, 4 figure

Mass Action Kinetic Model of Apoptosis by TRAIL-Functionalized Leukocytes

Background: Metastasis through the bloodstream contributes to poor prognosis in many types of cancer. A unique approach to target and kill colon, prostate, and other epithelial-type cancer cells in the blood has been recently developed that uses circulating leukocytes to present the cancer-specific, liposome-bound Tumor Necrosis Factor (TNF)-related apoptosis inducing ligand (TRAIL) on their surface along with E − selectin adhesion receptors. This approach, demonstrated both in vitro with human blood and in mice, mimics the cytotoxic activity of natural killer cells. The resulting liposomal TRAIL-coated leukocytes hold promise as an effective means to neutralize circulating tumor cells that enter the bloodstream with the potential to form new metastases.Methods: The computational biology study reported here examines the mechanism of this effective signal delivery, by considering the kinetics of the coupled reaction cascade, from TRAIL binding death receptor to eventual apoptosis. In this study, a collision of bound TRAIL with circulating tumor cells (CTCs) is considered and compared to a prolonged exposure of CTCs to soluble TRAIL. An existing computational model of soluble TRAIL treatment was modified to represent the kinetics from a diffusion-limited 3D reference frame into a 2D collision frame with advection and adhesion to mimic the E − selectin and membrane bound TRAIL treatment. Thus, the current model recreates the new approach of targeting cancer cells within the blood. The model was found to faithfully reproduce representative observations from experiments of liposomal TRAIL treatment under shear.Results: The model predicts apoptosis of CTCs within 2 h when treated with membrane bound TRAIL, while apoptosis in CTCs treated with soluble TRAIL proceeds much more slowly over the course of 10 h, consistent with previous experiments. Given the clearance rate of soluble TRAIL in vivo, this model predicts that the soluble TRAIL method would be rendered ineffective, as found in previous experiments.Conclusion: This study therefore indicates that the kinetics of the coupled reaction cascade of liposomal E − selectin and membrane bound TRAIL colliding with CTCs can explain why this new approach to target and kill cancer cells in blood is much more effective than its soluble counterpart

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Abstract. Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments 4. In particular, non-leftmost unfolding steps can produce incorrect results since the independence of the computation rule no longer holds in the presence of impure predicates. Existing proposals allow non-leftmost unfolding steps, but at the cost of accuracy: bindings and failure are not propagated backwards to predicates which are potentially impure. In this work we propose a partial evaluation scheme which substantially reduces the situations in which such backpropagation has to be avoided. With this aim, our partial evaluator takes into account the information about purity of predicates expressed in terms of assertions. This allows achieving some optimizations which are not feasible using existing partial evaluation techniques. We argue that our proposal goes beyond existing ones in that it is a) accurate, since the classification of pure vs impure is done at the level of atoms instead of predicates, b) extensible, as the information about purity can be added to programs using assertions without having to modify the partial evaluator itself, and c) automatic, since (backwards) analysis can be used to automatically infer the required assertions. Our approach has been implemented in the context of CiaoPP, the abstract interpretation-based preprocessor of the Ciao logic programming system.

The Speed of Fronts of the Reaction Diffusion Equation

We study the speed of propagation of fronts for the scalar reaction-diffusion equation $u_t = u_{xx} + f(u)$\, with $f(0) = f(1) = 0$. We give a new integral variational principle for the speed of the fronts joining the state $u=1$ to $u=0$. No assumptions are made on the reaction term $f(u)$ other than those needed to guarantee the existence of the front. Therefore our results apply to the classical case $f > 0$ in $(0,1)$, to the bistable case and to cases in which $f$ has more than one internal zero in $(0,1)$.Comment: 7 pages Revtex, 1 figure not include