We introduce relational decomposition, a technique for formally reducing termination-insensitive relational program logics to unary logics, that is program logics for one-execution properties. Generalizing the approach of selfcomposition, we develop a notion of interpolants that decompose along the phrase structure, and relate these interpolants to unary and relational predicate transformers. I...

Abstract Uniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within automated reasoning community investigated uniform quantifier-free (sometimes referred to as “covers”) first-order theories. This further is motivated by fact that offer an effective solution tackle quantifier elimination and symbol problems, which ...

in this paper, quadratic rules for obtaining approximate solution of definite integrals as well as single and double integrals using spline quasi-interpolants will be illustrated. the method is applied to a few test examples to illustrate the accuracy and the implementation of the method

The Newton-Lagrange interpolation is a well-known problem in elementary calculus. Recall basic facts concerning this problem [6], [2]. Let Ak, k = 0, 1, 2, . . . and ak, k = 0, 1, 2, . . . be two arbitrary sequences of complex numbers (we assume that all ak are distinct ak 6= aj if k 6= j. By interpolation polynomial we mean a n-degree polynomial Pn(z) whose values at points a0, a1, . . . , an ...