Context-sensitive rewriting is a restriction of term rewriting used to model evaluation strategies in functional programming and in programming languages like OBJ. For example, under certain conditions termination of an OBJ program is equivalent to innermost termination of the corresponding contextsensitive rewrite system [25]. To prove termination of context-sensitive rewriting, several method...

"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion ...

Induced abortion may be desired during a normal or abnormal pregnancy. The methods of induced abortion differ between species mainly because of different sources for progesterone production during pregnancy between species and within a species according to different stages of gestation. In cows and buffaloes, pregnancy can be effectively terminated from 5 to 150 days by administration of luteol...

Abortion is an important problem in obstetrics throughout the world. The common and standard method for pregnancy termination at first trimester is surgery (curettage). Nowadays, an effective method of pregnancy termination at first trimester is medical treatments. The aim of this study is to compare misoprostol alone or in combination with methotrexate for pregnancy termination at first trimes...

We present a heuristic framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/non-termination proof approaches. We introduce an idea of termination prediction, which predicts termination of a logic program in case that neither a termination nor a non-termination proof is applicable. We establish a necessary and sufficient characte...

We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not necessary. Instead, all provably termina...

research works proposed that radical scavenging activity of flavonoids is due to ring b, andthe remaining part of the molecule can be disregarded. thus the objective of this work is toobserve whether hydroxytoluenes account the radical scavenging activity of flavonoid and toestablish structural requirements for their activity (as they showed appreciable activity) andelucidate a comprehensive me...