Paracoherent answer set computation (Q2238696)

From MaRDI portal
Revision as of 15:09, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Paracoherent answer set computation
scientific article

    Statements

    title
    Paracoherent answer set computation (English)
    0 references
    author
    Giovanni Amendola
    0 references
    Carmine Dodaro
    0 references
    Wolfgang Faber
    0 references
    Francesco Ricca
    0 references
    publication date
    2 November 2021
    0 references
    zbMATH Keywords
    answer set programming
    0 references
    paracoherent reasoning
    0 references
    semi-equilibrium models
    0 references
    semi-stable models
    0 references
    describes a project that uses
    SATzilla
    0 references
    Potassco
    0 references
    clasp
    0 references
    WASP
    0 references
    Clingo
    0 references
    lp2normal
    0 references
    cites work
    Advances in WASP
    0 references
    Q4800172
    0 references
    Q4199578
    0 references
    Tight logic programs
    0 references
    Q4296747
    0 references
    Q3011296
    0 references
    Q3983043
    0 references
    Q2723419
    0 references
    Equilibrium logic
    0 references
    Q3983045
    0 references
    Q3184604
    0 references
    Q3624141
    0 references

    Identifiers

    zbMATH DE Number
    7418678
    0 references
    OpenAlex ID
    W3157980852
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2238696&oldid=38960932"
    Powered by MediaWiki