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...

If L1 and L2 are linear equations, then the disjunctive Rado number of the set {L1, L2} is the least integer n, provided that it exists, such that for every 2-coloring of the set {1, 2, . . . , n} there exists a monochromatic solution to either L1 or L2. If such an integer n does not exist, then the disjunctive Rado number is infinite. In this paper, it is shown that for all integers a 1 and b ...

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 firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

In this paper we propose an argumentation-based semantic framework , called DAS, for disjunctive logic programming. The basic idea is to translate a disjunctive logic program into an argumentation-theoretic framework. One unique feature of our proposed framework is to consider the disjunctions of negative literals as possible assumptions so as to represent incomplete information. In our framewo...