Document Type
Conference Proceeding
Publication Date
1-1-1992
Abstract
The relationship between 2-valued circumscription and well-founded semantics of normal and disjunctive logic programs is addressed. For normal programs, we derive conditions under which the well-founded model coincides with the intersection of 2-valued models of prioritized circumscription. For disjunctive programs, we show that the refined semantics by Chen and Kundu coincides with the semantics of prioritized circumscription.
Publication Source (Journal or Book title)
Applied Computing: Technological Challenges of the 1990's
First Page
554
Last Page
562
Recommended Citation
Chen, J. (1992). On the relationship between circumscription and well-founded semantics of logic programs. Applied Computing: Technological Challenges of the 1990's, 554-562. https://doi.org/10.1145/143559.143687
COinS
