Compiling finite linear CSP into SAT (Q842794)

From MaRDI portal
Revision as of 04:56, 10 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
Compiling finite linear CSP into SAT
scientific article

    Statements

    title
    Compiling finite linear CSP into SAT (English)
    0 references
    author
    Naoyuki Tamura
    0 references
    Akiko Taga
    0 references
    Satoshi Kitagawa
    0 references
    Mutsunori Banbara
    0 references
    published in
    Constraints
    0 references
    publication date
    25 September 2009
    0 references
    zbMATH Keywords
    constraint satisfaction problems
    0 references
    SAT encoding
    0 references
    open-shop scheduling problems
    0 references
    describes a project that uses
    Walksat
    0 references
    MiniSat
    0 references
    Sugar
    0 references
    Beam-ACO
    0 references
    Chaff
    0 references

    Identifiers

    zbMATH DE Number
    5607556
    0 references
    OpenAlex ID
    W2605289564
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q842794&oldid=38497705"
    Powered by MediaWiki