Differential expression and HIV-1 regulation of μ-opioid receptor splice variants across human central nervous system cell types.pdfVIP

下载本文档

0
0
约5.57万字
约 15页
2018-01-14 发布于河北
举报
版权申诉

Differential expression and HIV-1 regulation of μ-opioid receptor splice variants across human central nervous system cell types.pdf

1、本文档共15页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Differential expression and HIV-1 regulation of μ-opioid receptor splice variants across human central nervous system cell types

Termination Analysis of Logic Programs Based on Dependency Graphs 1 2 2 Manh Thang Nguyen , J¨urgen Giesl , Peter Schneider-Kamp , and Danny De Schreye1 1 Department of Computer Science, K. U. Leuven, Belgium {ManhThang.Nguyen,Danny.DeSchreye}@cs.kuleuven.be 2 LuFG Informatik 2, RWTH Aachen, Germany {giesl,psk}@informatik.rwth-aachen.de Abstract. This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of de- pendency pairs and dependency graphs (which were developed for term rewriting) to the logic programming domain. The main idea of the ap- proach is that termination conditions for a program are established based on the decomposition of its dependency graph into its strongly connected components. These conditions can then be analysed separately by pos- sibly diﬀerent well-founded orders. We propose a constraint-based ap- proach for automating the framework. Then, for example, termination techniques based on polynomial interpretations can be plugged in as a component to generate well-founded orders. 1 Introduction Termination analysis in logic programming (LP) traditionally aims at proving that a given logic program terminates w.r.t. a speciﬁc set of queries. Termination proofs are usually done by ﬁnding ranking functions that map the states of the program to a sequence of elements of a well-founded domain such that the sequence is decreasing w.r.t. the well-founded order of the domain. Practically, it is suﬃcient to consider only the states that are involved in loops of