Proving completeness of logic programs with the cut (Q511027): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68N17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6684505 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
logic programming | |||
Property / zbMATH Keywords: logic programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cut | |||
Property / zbMATH Keywords: cut / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
operational semantics | |||
Property / zbMATH Keywords: operational semantics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
program completeness | |||
Property / zbMATH Keywords: program completeness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
program correctness | |||
Property / zbMATH Keywords: program correctness / rank | |||
Normal rank |
Revision as of 02:48, 1 July 2023
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