Negation as failure using tight derivations for general logic programs (Q3821633): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Allen van Gelder / rank | |||
| Property / author | |||
| Property / author: Allen van Gelder / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(89)90032-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157221482 / rank | |||
Normal rank | |||
Latest revision as of 22:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Negation as failure using tight derivations for general logic programs |
scientific article |
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
