We propose a proof method in the style of Hoare's logic, aimed at providing a unifying framework for the veriication of logic and Prolog programs with respect to their speciications. The method, which relies on purely declarative reasoning, has been designed as a trade-oo between expressive power and ease of use. On the basis of a few simple principles, we reason uniformly on several properties...

In this paper, we describe a logic programming and program verification system which is based on quantifier elimination techniques and axiomatization rather than on more common method of doing logic programming using the Herbrand-Prawitz-Robinson unification algorithm without occur-check. This system is shown to have interesting properties for logic programming and includes a number of advanced...

We study the anisotropic flow V = bk where b > 0. We prove that if 13 < σ ≤ 1, only type I blow up occurs and if 0 < σ < 13 Type II blow up occurs. We also establish a prior estimates and existence of stationary solutions of self-similar curves and the existence of “ Abresch-Langer” type curves.