On the relationship between circumscription and well-founded semantics of logic programs

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.