Branching: the Essence of Constraint Solving

This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains. The paper presents a formal specification of the schema and a statement of a number of interesting properties that, subject to certain conditions, are satisfied by any instances of the schema. It is also shown that the operational procedures of many constraint systems including cooperative systems) satisfy these conditions. Moreover, the schema is also used to solve the same CSP in different ways by means of different instantiations of its parameters.Comment: 18 pages, 2 figures, Proceedings ERCIM Workshop on Constraints (Prague, June 2001

The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems

Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved and extended by joining scrupulous research on the theoretical foundations of (possibly non-convex) numerical abstractions to a total adherence to the best available practices in software development. Even though it is still not fully mature and functionally complete, the Parma Polyhedra Library already offers a combination of functionality, reliability, usability and performance that is not matched by similar, freely available libraries. In this paper, we present the main features of the current version of the library, emphasizing those that distinguish it from other similar libraries and those that are important for applications in the field of analysis and verification of hardware and software systems.Comment: 38 pages, 2 figures, 3 listings, 3 table

An Improved Tight Closure Algorithm for Integer Octagonal Constraints

Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programming and formal analysis and verification of software and hardware systems, since they couple algorithms having polynomial complexity with a relatively good expressive power. The main algorithms required for the manipulation of such constraints are the satisfiability check and the computation of the inferential closure of a set of constraints. The latter is called `tight' closure to mark the difference with the (incomplete) closure algorithm that does not exploit the integrality of the variables. In this paper we present and fully justify an O(n^3) algorithm to compute the tight closure of a set of UTVPI integer constraints.Comment: 15 pages, 2 figure

Growing Pains for the Los Angeles Healthy Kids Program: Findings From the Second Evaluation Case Study (Nov 2008)

Analyzes the initiative's continued efforts to provide health insurance for poor children ineligible for Medi-Cal or Healthy Families, as well as the challenges it faces, including the enrollment hold placed on 6- to 18-year-olds due to funding shortages

Growing Pains for the Los Angeles Healthy Kids Program: Findings From the Second Evaluation Case Study (Apr 2008)

Evaluates the program to provide health coverage to poor children ineligible for Medi-Cal or Healthy Families in terms of outreach, enrollment, and retention; benefits, service delivery, and access; financing and stability; and program improvement

Spiritual Well-Being of Black LGBT Individuals When Faced With Religious Homonegativity

Spiritual Well-Being of Black LGBT Individuals When Faced With Religious Homonegativity by Patricia A. Hill MA, Loyola University-Chicago, 2004 BS, Chicago State University, 2000 Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Psychology Walden University May 2015 Abstract Black lesbian, gay, bisexual, and transgendered (LGBT) individuals in the United States often face homophobic sermons and messages within their traditional religious settings. This phenomelogical research study was designed to document and understand the lived experiences of Black LGBT individuals\u27 spiritual well-being in the face of homonegativity, and to identify the ways in which they cope with these experiences. The qualitative interview data from 9 participants were interpreted through the lens of feminist theory and Pargament\u27s theory of the psychology of religion and coping. Recurring themes were coded from the participants\u27 interviews using the QSR Nvivo 10 software program. Interview themes included change in faith community, experiencing familial acceptance or discord/rejection due to sexual orientation, feelings of abandonment by God/religion, negative experiences in a religious setting due to sexual orientation, emotional reactions, maladaptive coping, adaptive coping, and religious and/or spiritual reconciliation. The results of this study provide insight into the challenges that Black LGBT individual experience with religious homonegativity and they ways in which they cope with these stresses and challenges. This study promotes positive social change by providing a better understanding of the impact of Christian religion on the mental and spiritual well-being of the Black LGBT individual. These findings can be used to inform therapists and psychologists who are seeking treatment strategies for their Black LGBT clients. The findings suggest there is an educational component that also could benefit family, friends, and religious leaders who want to be present and accepting of the Black LGBT community