While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order ...

BACKGROUND Geostatistical techniques that account for spatially varying population sizes and spatial patterns in the filtering of choropleth maps of cancer mortality were recently developed. Their implementation was facilitated by the initial assumption that all geographical units are the same size and shape, which allowed the use of geographic centroids in semivariogram estimation and kriging....

In this report, we provide the first characterization of abducens nucleus neuron (ABN) discharge dynamics during horizontal disjunctive saccades. These movements function to rapidly transfer the visual axes between targets located at different eccentricities and depths. Our primary objective was to determine whether the signals carried by ABNs during these movements are appropriate to drive the...

Disjunctive Answer Set Solvers Remi Brochenin1 and Yuliya Lierler2 and Marco Maratea3 Abstract. A fundamental task in answer set programming is to compute answer sets of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has an answer set is Σ2 -complete. The high complexity of reasoning within disjunctive logic prog...

Closed world assumptions are one of the major approaches for non{monotonic reasoning in artiicial intelligence. In 16] this formalism is applied to disjunctive logic programs, i.e. logic programs with positive disjunctive rule heads and positive atoms in the rule bodies. The disjunctive closure operator T S P allows for the derivation of the set MSP of all positive disjunctive clauses logically...

Truncated Gaussian simulation (TGS) and plurigaussian simulation (PGS) are widely accepted methods for generating realisations of geological domains (lithofacies) that reproduce contact relationships. The realisations can be used to evaluate transfer functions related to the lithofacies occurrence, the simplest ones of which are the probability of occurrence of each lithofacies and the most pro...

This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new xpoint semantics of extende...

While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowal-ski's abductive proof procedure for normal programs can be adop...

A study was designed to compare the performance of six spatial interpolation methods to estimate soil properties at unvisited points. These methods were global mean, moving average, nearest neighbour, inverse squared distance, Laplacian smoothing splines and ordinary point kriging. These methods were also applied in combination with a choropleth map (soil map) by stratifying the area. The soil ...