Graphical Processing Units (GPUs) consist of hundreds of small cores, collectively operating to provide massive computation capabilities. The aim of this work is to utilize this technology to execute Constraint Handling Rules (CHR) which are inherently parallel. A translation scheme is defined to transform a subset of CHR rules to C/C++, then to use a GPU to fire the rules on all combinations o...

We motivate and develop a linear logic declarative semantics for CHR∨, an extension of the CHR programming language that integrates concurrent committed choice with backtrack search and a predefined underlying constraint handler. We show that our semantics maps each of these aspects of the language to a distinct aspect of linear logic. We show how we can use this semantics to reason about deriv...

BACKGROUND Individuals at clinical high risk (CHR) for psychosis represent a heterogeneous group with a high rate of comorbid psychiatric disorders. There is little information on whether certain qualitative aspects of psychotic symptoms among CHR individuals may be predictive of future psychosis. This study focused on describing the prevalence of first-rank symptoms (FRS) among a sample of CHR...

We consider a broad family of vehicle routing problem variants with many complex and practical constraints, known as rich problems, which are faced on daily basis by C.H. Robinson (CHR). Because CHR has customers, each distinct requirements, various problems different objectives constraints must be solved. propose novel framework for solving we demonstrate is effective in variety problems. This...

In intestinal transplantation, while other centers have shown that liver-including allografts significantly more favorable graft survival and loss-due-to chronic rejection (CHR) rates, our center has consistently modified multivisceral (MMV) full (MV) acute cellular (ACR) severe ACR rates compared with isolated intestine (I) liver-intestine (LI) allografts. the attempt to resolve this apparent ...

Constraint Handling Rules (CHR) have provided a realistic solution to an over-arching problem in many elds that deal with constraint logic programming: how to combine recursive functions or relations with constraints while avoiding non-termination problems. This paper focuses on some other bene ts that CHR, speci cally their implementation in SICStus Prolog, have provided to computational lingu...

In this paper, we propose an extension of Constraint Handling Rules (CHR) with different visualization features. One feature is to visualize the execution of rules applied on a list of constraints. The second feature is to represent some of the CHR constraints as objects and visualize the effect of CHR rules on them. To avoid changing the compiler, our implementation is based on source-to-sourc...

Two Constraint Handling Rules compiler optimizations that drastically reduce the memory footprint of CHR programs are introduced. The reduction is the result of reusing suspension terms, the internal CHR constraint representation, and avoiding the overhead of constraint removal followed by insertion. The optimizations are defined formally and their correctness is proved. Both optimizations were...