Dix [7, 5, 6] introduced a method for classifying semantics of normal logic programs. Some of these properties, called strong properties, are adaptations of properties from general nommonotonic theories. We apply this technique to circumscriptive logic programs [8, 9], an extension of traditional logic programming that incorporates circumscriptive policies in the programs. We show this approach preserves cumulativity, although it is not rational and supraclassical. This suggests circumscriptive logic programs have a correct behavior, maintaining properties from normal logic programsEje: Inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI
