Weak generalized closed world assumption
type: Item
instance of: scholarly article
title: Weak generalized closed world assumption
zbMATH Open document ID: 0683.68086
DOI: 10.1007/BF00248321
author: Arcot Rajasekar
author: Jorge Lobo
author: Jack Minker
published in: Journal of Automated Reasoning
publication date: 1989-01-01T00:00:00Z
review text: The Weak Generalized Closed World Assumption is introduced. This is a way to deal with negation in logic programs. With this rule the negation \(\neg A\) of a positive literal A is inferred only if \(A\vee K\) is not derivable for any positive K. In contrast with the Generalized Closed World Assumption it is not necessary that K is derivable. The Weak Generalized Closed World Assumption corresponds to the negation as finite failure rule.
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 4119671
zbMATH Keywords: logic programming
zbMATH Keywords: Closed World Assumption
zbMATH Keywords: negation as finite failure
MaRDI profile type: Publication
Wikidata QID: Q109585681
cites work: Contributions to the Theory of Logic Programming
cites work: Linear resolution with selection function
cites work: Q3339245
cites work: Closures and fairness in the semantics of programming logic
cites work: Q3939270
cites work: A fixpoint semantics for disjunctive logic programs
cites work: Q3820058
cites work: An extension to linear resolution with selection function
cites work: Inferring negative information from disjunctive databases
cites work: Q5750391
cites work: The Semantics of Predicate Logic as a Programming Language
description: scientific article; zbMATH DE number 4119671