نتایج جستجو برای: (baa/baa chr)

تعداد نتایج: 2070  

2008
Jon Sneyers Thom Frühwirth

Constraint Handling Rules (CHR) is a high-level rule-based programming language. In [11], a model of computation based on the operational semantics of CHR is introduced, called the CHR machine. The CHR machine was used to prove a complexity-wise completeness result for the CHR language and its implementations. In this paper, we investigate three generalizations of CHR machines: CHR machines wit...

Journal: :Journal of lipid research 1996
C L Welch Y R Xia I Shechter R Farese M Mehrabian S Mehdizadeh C H Warden A J Lusis

As part of an effort to dissect the genetic factors involved in cholesterol homeostasis in the mouse model, we report the mapping of 12 new candidate genes using linkage analysis. The genes include: cytoplasmic HMG-CoA synthase (Hmgcs 1, Chr 13), mitochondrial synthase (Hmgcs 2, Chr 3), a synthase-related sequence (Hmgcs 1-rs, Chr 12), mevalonate kinase (Mvk, Chr 5), farnesyl diphosphate syntha...

2007
Marc Meister Khalil Djelloul Jacques Robin

Reasoning on Constraint Handling Rules (CHR) programs and their executional behaviour is often ad-hoc and outside of a formal system. This is a pity, because CHR subsumes a wide range of important automated reasoning services. Mapping CHR to Transaction Logic (T R) combines CHR rule specification, CHR rule application, and reasoning on CHR programs and CHR derivations inside one formal system w...

Journal: :Physiological genomics 2006
Victoria L M Herrera Aristides Tsikoudakis Lorenz R B Ponce Yuichi Matsubara Nelson Ruiz-Opazo

Sex-specific differences in polygenic (essential) hypertension are commonly attributed to the role of sex steroid hormone-receptor systems attenuating sex-common disease mechanisms in premenopausal women. However, emerging observations indicate sex-specific genetic susceptibility in various traits, thus requiring systematic study. Here we report a comparative analysis of independent total genom...

Journal: :TPLP 2011
Edmund Soon Lee Lam Martin Sulzmann

We introduce a systematic, concurrent execution scheme for Constraint Handling Rules (CHR) based on a previously proposed sequential goal-based CHR semantics. We establish strong correspondence results to the abstract CHR semantics, thus guaranteeing that any answer in the concurrent, goal-based CHR semantics is reproducible in the abstract CHR semantics. Our work provides the foundation to obt...

2006
Victoria L. M. Herrera Aristides Tsikoudakis Lorenz R. B. Ponce Yuichi Matsubara Nelson Ruiz-Opazo

Herrera, Victoria L. M., Aristides Tsikoudakis, Lorenz R. B. Ponce, Yuichi Matsubara, and Nelson Ruiz-Opazo. Sex-specific QTLs and interacting loci underlie salt-sensitive hypertension and target organ complications in Dahl S/jr hypertensive rats. Physiol Genomics 26: 172–179, 2006. First published May 23, 2006; doi:10.1152/physiolgenomics.00285.2005.—Sex-specific differences in polygenic (esse...

Journal: :J. Log. Program. 1998
Thom W. Frühwirth

Constraint Handling Rules (CHR) are our proposal to allow more exibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-deened constraints. CHR are essentially a committed-choice language consisting of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this b...

2014
Nada Sharaf Slim Abdennadher Thom W. Frühwirth

Visualization tools of different languages offer its users with a needed set of features allowing them to animate how programs of such languages work. Constraint Handling Rules (CHR) is currently used as a general purpose language. This results in having complex programs with CHR. Nevertheless, CHR is still lacking on visualization tools. With Constraint Handling Rules (CHR) being a high-level ...

2008
Jon Sneyers

Interesting subclasses of CHR are still Turing-complete: CHR with only one kind of rule, with only one rule, and propositional refined CHR. This is shown by programming a simulator of Turing machines (or Minsky machines) within those subclasses. Single-headed CHR without host language and propositional abstract CHR are not Turing-complete.

Journal: :TPLP 2009
Leslie De Koninck

This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema from LA to CHR: CHR with rule priorities, and show that the meta-complexity theorem for LA can be applied to a subset of CHR via inverse translation. Inspired by the high-level implementation proposal for Logical A...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید