The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230)

From MaRDI portal
Revision as of 00:02, 20 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
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
scientific article

    Statements

    title
    The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (English)
    0 references
    author
    Mario Alviano
    0 references
    Wolfgang Faber
    0 references
    publication date
    10 October 2013
    0 references
    zbMATH DE Number
    6214647
    0 references
    OpenAlex ID
    W50549667
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2851230&oldid=32299930"
    Powered by MediaWiki