Negation in Disjunctive Logic Programs
نویسندگان
چکیده
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 disjunctive programs, which was initially introduced in [Sak89] for positive disjunctive programs. The possible world assumption (PWA) infers negation under the possible world semantics, which lies between the GCWA and the WGCWA in positive disjunctive programs. The PWA is also extended to the PWA : for general disjunctive programs. Then it is shown that the PWA : provides a powerful and the most careful negative inference compared with the GCWA : and the WGCWA : . We also present a bottom-up model generation proof procedure to compute each negation in general disjunctive programs.
منابع مشابه
Semantics for Disjunctive Logic Programs with Explicit and Default Negation
The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...
متن کاملAn Eecient Computation of the Extended Generalized Closed World Assumption by Support{for{negation Sets
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...
متن کاملStable Semantics for Disjunctive Programs
[VG89b] A. Van Gelder. Negation as failure using tight derivations for general logic programs. [Prz91c] T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Articial Intelligence, 1991. (In print. Extended abstract appeared in: T. C. Przy-musinski. Three-valued non-monotonic formalisms and logic programming. [Ros89b] K. Ross. The well founded sem...
متن کاملNegation as Failure in the Head
The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is an extension of the class of extended disjunctive programs. An interesting feature of such programs is that the minimality of answer sets does not hold. This paper considers the class of general extended disjunctive programs (GEDPs) as logic programs with negation as ...
متن کاملFirst-Order Expressibility and Boundedness of Disjunctive Logic Programs
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the propos...
متن کامل