Combining Closed World Assumptions with Stable Negation

Article type: Research Article

Authors: Ruiz, Carolina | Minker, Jack

Affiliations: Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA 01609 U. S. A. ruiz@cs.wpi.edu | Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland College Park, MD 20742 U. S. A. minker@cs.umd.edu

Abstract: We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of default negations. We introduce operators notG, notW, and notSTB in the language of logic programs to represent the Generalized Closed World Assumption, the Weak Generalized Closed World Assumption, and the stable negation, respectively. The notion of stratification involving different kinds of negations is defined and the meaning of stratified programs with multiple negations is described. The class of stratified programs is extended to the class of quasi-stratified programs and the semantics of the latest class is studied.

DOI: 10.3233/FI-1997-32205

Journal: Fundamenta Informaticae, vol. 32, no. 2, pp. 163-181, 1997