@inproceedings{0557bde3f03b4090990c4f6ece1f0e12,

title = "Generalized negation as failure and semantics of normal disjunctive logic programs",

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].",

author = "Chitta Baral",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; International Conference on Logic Programming and Automated Reasoning, LPAR 1992 ; Conference date: 15-07-1992 Through 20-07-1992",

year = "1992",

doi = "10.1007/BFb0013071",

language = "English (US)",

isbn = "9783540557272",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "309--319",

editor = "Andrei Voronkov",

booktitle = "Logic Programming and Automated Reasoning - International Conference LPAR 1992, Proceedings",

}