@inproceedings{0a06ae0a7d2b4ef499d1ccfc8598ad09,
title = "Generalized well-founded semantics for logic programs",
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.",
author = "Chitta Baral and Jorge Lobo and Jack Minker",
note = "Funding Information: We wish to express our appreciation to the National Science Foundation for their support of our work under grant number IRI-86-09170 and the Army Research Office under grant number DAAG-29-85-K-0-177. Publisher Copyright: {\textcopyright} Springer-Veflag Berlin Heidelberg 1990.; 10th International Conference on Automated Deduction, CADE 1990 ; Conference date: 24-07-1990 Through 27-07-1990",
year = "1990",
doi = "10.1007/3-540-52885-7_82",
language = "English (US)",
isbn = "9783540528852",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--116",
editor = "Stickel, {Mark E.}",
booktitle = "10th International Conference on Automated Deduction, Proceedings",
}