Complexity and undecidability results for logic programming (Q1924779)

From MaRDI portal
Revision as of 08:52, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity and undecidability results for logic programming
scientific article

    Statements

    Complexity and undecidability results for logic programming (English)
    0 references
    0 references
    25 March 1997
    0 references
    degree of uncomputability
    0 references
    expressive power
    0 references

    Identifiers