Planning as satisfiability: heuristics (Q359984)

From MaRDI portal
Revision as of 19:41, 6 July 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
Planning as satisfiability: heuristics
scientific article

    Statements

    title
    Planning as satisfiability: heuristics (English)
    0 references
    author
    Jussi Rintanen
    0 references
    publication date
    23 August 2013
    0 references
    describes a project that uses
    Walksat
    0 references
    Chaff
    0 references
    MathSAT
    0 references
    Siege
    0 references
    Graphplan
    0 references
    cites work
    Q5687271
    0 references
    Q5715680
    0 references
    Q3396552
    0 references
    Q3455599
    0 references
    Algorithm portfolios
    0 references
    Q2717791
    0 references
    Q4012216
    0 references
    Q3682518
    0 references
    Q5503674
    0 references
    Q3455576
    0 references
    Q4422082
    0 references
    Q2849590
    0 references
    Q4252522
    0 references

    Identifiers

    zbMATH DE Number
    6201268
    0 references
    OpenAlex ID
    W2048644716
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q359984&oldid=35348292"
    Powered by MediaWiki