Proving completeness of logic programs with the cut (Q511027): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q130853227, #quickstatements; #temporary_batch_1733734142609 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00165-016-0392-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00165-016-0392-0 / rank | |||
Normal rank | |||
Latest revision as of 19:53, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving completeness of logic programs with the cut |
scientific article |
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
