Generalized well-founded semantics for logic programs

Chitta Baral, Jorge Lobo, Jack Minker

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

15 Scopus citations

Abstract

We extend the well-founded semantics of Van Gelder et al. [12] so that it is able to reason through clauses instead of single literals. This is necessary to infer p to be true in the program {p ← a; p ← b; a ← ¬b; b ← ¬a}. We call this generalized semantics, the generalized well-founded semantics. We present fixpoint and model theoretic definitions for generalized well-founded semantics and show their equivalence.

Original languageEnglish (US)
Title of host publication10th International Conference on Automated Deduction, Proceedings
EditorsMark E. Stickel
PublisherSpringer Verlag
Pages102-116
Number of pages15
ISBN (Print)9783540528852
DOIs
StatePublished - 1990
Externally publishedYes
Event10th International Conference on Automated Deduction, CADE 1990 - Kaiserslautern, Germany
Duration: Jul 24 1990Jul 27 1990

Publication series

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

Other

Other10th International Conference on Automated Deduction, CADE 1990
CountryGermany
CityKaiserslautern
Period7/24/907/27/90

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Generalized well-founded semantics for logic programs'. Together they form a unique fingerprint.

Cite this