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

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 different 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 specific set of queries. Termination proofs are usually done by finding 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 sufficient to consider only the states that are involved in loops of