Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253)

From MaRDI portal
Revision as of 01:54, 9 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
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
scientific article

    Statements

    Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    Boolean satisfiability
    0 references
    backdoor sets
    0 references
    Horn
    0 references
    RHorn
    0 references
    clause learning
    0 references
    search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers