Generalized negation as failure and semantics of normal disjunctive logic programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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

Original languageEnglish (US)
Title of host publicationLogic Programming and Automated Reasoning - International Conference LPAR 1992, Proceedings
EditorsAndrei Voronkov
PublisherSpringer Verlag
Pages309-319
Number of pages11
ISBN (Print)9783540557272
DOIs
StatePublished - Jan 1 1992
Externally publishedYes
EventInternational Conference on Logic Programming and Automated Reasoning, LPAR 1992 - St. Petersburg, Russian Federation
Duration: Jul 15 1992Jul 20 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume624 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Logic Programming and Automated Reasoning, LPAR 1992
CountryRussian Federation
CitySt. Petersburg
Period7/15/927/20/92

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Generalized negation as failure and semantics of normal disjunctive logic programs'. Together they form a unique fingerprint.

  • Cite this

    Baral, C. (1992). Generalized negation as failure and semantics of normal disjunctive logic programs. In A. Voronkov (Ed.), Logic Programming and Automated Reasoning - International Conference LPAR 1992, Proceedings (pp. 309-319). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 624 LNAI). Springer Verlag. https://doi.org/10.1007/BFb0013071