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

An ω-language over a finite alphabet X is a set of infinite sequences of letters of X. Consider congruences IL and Pω, L on X* and a congruence OL on X introduced by an ω-language L. IL, Pω, L, and OL are called the infinitary syntactic-congruence, the principal congruence and the ω-syntactic congruence of L, respectively. If IL (Pω, L, OL) is the equality then L is called an I-disjunctive (P-d...

Abstract This discussion note addresses Caleb Hazelwood’s ‘Practice-Centered Pluralism and a Disjunctive Theory of Art’. Hazelwood advances disjunctive definition art on the basis an analogy with species concept pluralism in philosophy biology. We recognize between art, we applaud attention to practice, are bullish pluralism—but it is mistake take these as for definition.

In recent years, much work was devoted to the study of theoretical foundations of Disjunctive Logic Programs and Disjunctive Deductive Databases. While the semantics of non-disjunctive programs is fairly well understood the declarative and computational foundations of disjunctive programming proved to be much more elusive and dif-cult. Recently, two new and very promising semantics have been pr...