Complexity and undecidability results for logic programming (Q1924779)

From MaRDI portal
Revision as of 14:22, 24 May 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    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
    cites work
    Q3960112
    0 references
    Q3477998
    0 references
    Q4075450
    0 references
    Q4318639
    0 references
    Q4052071
    0 references
    Q3478001
    0 references
    Q5750390
    0 references
    Q3992908
    0 references
    Q3939270
    0 references
    Autoepistemic logic
    0 references
    Q5750391
    0 references
    Q3348436
    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=34169005"
    Powered by MediaWiki