Relational heuristics for the design of deterministic programs (Q1077919)

From MaRDI portal
Revision as of 00:25, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    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

    Identifiers