We present a general comparison of punctual kriging based image restoration for different neighbourhood sizes. The formulation of the technique under consideration is based on punctual kriging and fuzzy concepts for image restoration in spatial domain. Three different neighbourhood windows are considered to estimate the semivariance at different lags for studying its effect in reduction of nega...

This paper deals with a theoretical approach to assessing the effects of parameter estimation uncertainty both on Kriging estimates and on their estimated error variance. Although a comprehensive treatment of parameter estimation uncertainty is covered by full Bayesian Kriging at the cost of extensive numerical integration, the proposed approach has a wide field of application, given its relati...

Disjunctive logic programs are a powerful tool in knowledge representation and commonsense reasoning. The recent development of an efficient disjunctive logic programming engine, named DLV, allows to exploit disjunctive logic programs for solving complex problems. However, disjunctive logic programming systems are currently missing any interface supporting the integration between commonly used ...

This paper presents a partial deduction method for disjunctive logic programs. We rst show that standard partial deduction in logic programming is not applicable as it is in the context of disjunctive logic programs. Then we introduce a new partial deduction technique for disjunctive logic programs, and show that it preserves the minimal model semantics of positive disjunctive programs, and the...

In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We de ne new rules, the GCWA : and the WGCWA : , which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general dis...

An !-word p over a nite alphabet is called disjunctive if every nite word over occurs as a subword in p. A real number is called disjunctive to base a if it has a disjunctive a-adic expansion. For every pair of integers a; b 2 such that there exist numbers disjunctive to base a but not to base b we explicitly construct very simple examples of such numbers. General versions of the following resu...

Non{Horn programs containing disjunctive rules allow for more advanced applications of deductive databases. But the inference process dealing with rapidly increasing amounts of disjunctive facts becomes much more intricate, because of the problems of nding resolvable atoms in the facts and of subsumption elimination in sets of facts. We present an eecient implementation of the xpoint computatio...

In this paper we study the ability of the Cokriging method to represent functions with multiple local minima and sharp discontinuities for use in the multidimensional design of a low-boom supersonic business jet wing-body-canard configuration. Cokriging approximation models are an extension of the original Kriging method which incorporate secondary information such as the values of the gradient...