Relational heuristics for the design of deterministic programs (Q1077919): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relational heuristics for the design of deterministic programs |
scientific article |
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
