Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs

Chitta Baral

Abstract

We introduce the concept of generalized negation as failure (GNAF) to infer the falsity of a conjunction of atoms when the individual atoms can not be inferred to be false. Using GNAF, we present disjunctive well-founded semantics (DWFS), an extension of well-founded semantics, to the class of normal disjunctive logic programs. We also use an extension of Rajasekar and Minker's fixpoint operator for disjunctive logic programs [10] to be able to infer the truth of disjunctions of literals. Our semantics is equivalent to well-founded semantics for normal logic programs. For disjunctive programs (i.e. without negation in their bodies) it gives a fixpoint characterization of Minker's GCWA [9]. It differs from the Generalized Disjunctive Well-Founded semantics by Baral et al. [2] and well-founded semantics for normal disjunctive logic programs given by Ross [14].
BibTeX
@inproceedings{baral1992generalized,
  author = {Chitta Baral},
  title = {{Generalized Negation As Failure and Semantics of Normal Disjunctive Logic Programs}},
  booktitle = {LPAR},
  year = {1992},
  doi = {10.1007/bfb0013071},
}

Loading related content...

Figure