Weak generalized closed world assumption (Q1825049)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weak generalized closed world assumption |
scientific article; zbMATH DE number 4119671
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weak generalized closed world assumption |
scientific article; zbMATH DE number 4119671 |
Statements
Weak generalized closed world assumption (English)
0 references
1989
0 references
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.
0 references
logic programming
0 references
Closed World Assumption
0 references
negation as finite failure
0 references
