Complexity and undecidability results for logic programming (Q1924779)

From MaRDI portal
Revision as of 15:11, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity and undecidability results for logic programming
scientific article

    Statements

    title
    Complexity and undecidability results for logic programming (English)
    0 references
    author
    John S. Schlipf
    0 references
    publication date
    25 March 1997
    0 references
    zbMATH Keywords
    degree of uncomputability
    0 references
    expressive power
    0 references

    Identifiers

    DOI
    10.1007/BF01536398
    0 references
    zbMATH DE Number
    937276
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1924779&oldid=14355798"
    Powered by MediaWiki