Negation as failure using tight derivations for general logic programs (Q3821633)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4094870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Negation as failure using tight derivations for general logic programs |
scientific article; zbMATH DE number 4094870 |
Statements
Negation as failure using tight derivations for general logic programs (English)
0 references
1989
0 references
general logic program
0 references
tight derivations
0 references
negation-as-failure rule
0 references
tight tree semantics
0 references
bounded-term-size
0 references
freedom from recursive negation
0 references
Herbrand base
0 references
iterated-fixed-point semantics
0 references
0.8515989184379578
0 references
0.8410049080848694
0 references
0.826024055480957
0 references
0.8254145979881287
0 references
