Terminating Links between Emission Trading Programs

Terminating links between emission trading programs

Links between emission trading programs are not immutable, as highlighted by New Jersey's exit from the Regional Greenhouse Gas Initiative in 2011. This raises the question of what to do with existing permits that are banked for future use—choices that have consequences for market behavior in advance of, or upon speculation about, delinking. We consider two delinking policies. One differentiate...

Classes of terminating logic programs

Termination of logic programs depends critically on the selection rule, i.e. the rule that determines which atom is selected in each resolution step. In this article, we classify programs (and queries) according to the selection rules for which they terminate. This is a survey and unified view on different approaches in the literature. For each class, we present a sufficient, for most classes e...

Generating Eecient, Terminating Logic Programs

The objective of control generation in logic programming is to automatically derive a computation rule for a program that is eecient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial solutions have been proposed where the generated programs are either incorrect or ineecient. We show how the control generation pro...

Transformation of Left Terminating Programs

We propose an unfold-fold transformation system which preserves left termination for deenite programs besides its declarative semantics. The system extends our previous proposal in BCE95] by allowing to switch the atoms in the clause bodies when a speciic applicability condition is satissed. The applicability condition is very simple to verify , yet very common in practice. We also discuss how ...

Complexity Analysis of Size-Change Terminating Programs