Proving correctness of constraint logic programs with dynamic scheduling (Q5030189)
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 7474225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proving correctness of constraint logic programs with dynamic scheduling |
scientific article; zbMATH DE number 7474225 |
Statements
Proving correctness of Constraint Logic Programs with dynamic scheduling (English)
0 references
16 February 2022
0 references
logic programming
0 references
delay condition
0 references
constraint system
0 references
predicate symbol
0 references
dynamic schedule
0 references
0.8111506104469299
0 references
0.7915377020835876
0 references
0.7786577343940735
0 references
0.7753746509552002
0 references
