Complexity of super-coherence problems in ASP (Q5418947)

From MaRDI portal
Revision as of 09:24, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6299130
Language Label Description Also known as
English
Complexity of super-coherence problems in ASP
scientific article; zbMATH DE number 6299130

    Statements

    title
    Complexity of super-coherence problems in ASP (English)
    0 references
    author
    Mario Alviano
    0 references
    Wolfgang Faber
    0 references
    Stefan Woltran
    0 references
    publication date
    30 May 2014
    0 references
    zbMATH Keywords
    answer set programming
    0 references
    complexity analysis
    0 references
    coherence
    0 references
    uniform equivalence
    0 references

    Identifiers

    zbMATH DE Number
    6299130
    0 references
    arXiv ID
    1212.5895
    0 references
    OpenAlex ID
    W3106488184
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5418947&oldid=36873644"
    Powered by MediaWiki