Relational heuristics for the design of deterministic programs (Q1077919)
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 3958706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relational heuristics for the design of deterministic programs |
scientific article; zbMATH DE number 3958706 |
Statements
Relational heuristics for the design of deterministic programs (English)
0 references
1987
0 references
It has been shown that the design of deterministic programs can be formulated as the resolution of relational equations. Because relational calculi are not sufficently structured, there are no algorithmic solutions to relational equations. In this paper, we formulate some heuristic solutions to these equations.
0 references
deterministic programs
0 references
relational equations
0 references
relational calculi
0 references
heuristic solutions
0 references
0.7481411695480347
0 references
0.7202845215797424
0 references
0.7160818576812744
0 references
