Proving completeness of logic programs with the cut (Q511027)
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 6684505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proving completeness of logic programs with the cut |
scientific article; zbMATH DE number 6684505 |
Statements
Proving completeness of logic programs with the cut (English)
0 references
14 February 2017
0 references
logic programming
0 references
cut
0 references
operational semantics
0 references
program completeness
0 references
program correctness
0 references
0.8798055052757263
0 references
0.8147026300430298
0 references
0.7682209014892578
0 references
