Unification as a complexity measure for logic programming (Q3782840)

From MaRDI portal
Revision as of 23:11, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unification as a complexity measure for logic programming
scientific article

    Statements

    Unification as a complexity measure for logic programming (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Turing computability
    0 references
    complexity measure
    0 references
    unification
    0 references
    Turing machines
    0 references
    Horn clause
    0 references
    computational completeness
    0 references
    hierarchy
    0 references
    logic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references