Backdoors to tractable answer set programming (Q2341833)

From MaRDI portal
Revision as of 15:09, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Backdoors to tractable answer set programming
scientific article

    Statements

    title
    Backdoors to tractable answer set programming (English)
    0 references
    author
    Johannes K. Fichte
    0 references
    Stefan Szeider
    0 references
    publication date
    6 May 2015
    0 references
    Mathematics Subject Classification ID
    68N17
    0 references
    68Q25
    0 references
    68T20
    0 references
    zbMATH DE Number
    6433855
    0 references
    zbMATH Keywords
    answer set programming
    0 references
    backdoors
    0 references
    computational complexity
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    describes a project that uses
    Gurobi
    0 references
    ASSAT
    0 references
    Potassco
    0 references
    Cmodels
    0 references
    dynASP
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2341833&oldid=23289691"
    Powered by MediaWiki