Combining Closed World Assumptions with Stable Negation

Authors:
Carolina Ruiz;Jack Minker
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
Venue:
Fundamenta Informaticae
Year:
1997

Citing 12
Cited 0

Inferring negative information from disjunctive databases

Journal of Automated Reasoning
Weak generalized closed world assumption

Journal of Automated Reasoning
Extended stable semantics for normal and disjunctive programs

Logic programming
Negation in rule-based database languages: a survey

Selected papers of the workshop on Deductive database theory
Arithmetic classification of perfect models of stratified programs

Fundamenta Informaticae
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Semantics for disjunctive logic programs with explicit and default negation

Fundamenta Informaticae
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Logic knowledge bases with two default rules

Annals of Mathematics and Artificial Intelligence
On Extended Disjunctive Logic Programs

ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
Semantics of knowledge-based systems with multiple forms of negation

Semantics of knowledge-based systems with multiple forms of negation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the semantics of disjunctive logic programs that simultaneously contain multiple kinds of default negations. We introduce operators not G, not W, and not STB 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.