Answer set programming based on propositional satisfiability (Q861709)

From MaRDI portal
Revision as of 13:18, 25 June 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
Answer set programming based on propositional satisfiability
scientific article

    Statements

    title
    Answer set programming based on propositional satisfiability (English)
    0 references
    author
    Enrico Giunchiglia
    0 references
    Yuliya Lierler
    0 references
    Marco Maratea
    0 references
    publication date
    30 January 2007
    0 references
    zbMATH DE Number
    5119742
    0 references
    zbMATH Keywords
    ASPSAT
    0 references
    describes a project that uses
    MiniSat
    0 references
    GNT
    0 references
    Cmodels
    0 references
    ASSAT
    0 references
    Chaff
    0 references
    BerkMin
    0 references
    OpenAlex ID
    W2100699693
    0 references
    cites work
    Q4804899
    0 references
    Q4809077
    0 references
    Q5715690
    0 references
    Q4781472
    0 references
    Q4736516
    0 references
    Q4800163
    0 references
    Q3983043
    0 references
    Q2703800
    0 references
    Logic Programming
    0 references
    Q4539619
    0 references
    Q4427901
    0 references
    Logic Programming
    0 references
    Q4514010
    0 references
    Logic Programming
    0 references
    Q4256671
    0 references
    Q3682462
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q861709&oldid=34914952"
    Powered by MediaWiki