Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Unsatisfiability-based optimization in clasp / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving (Weighted) Partial MaxSAT through Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Encodings of Pseudo-Boolean Constraints into CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Calculus for Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Modulo the Theory of Costs: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting the Power of mip Solvers in maxsat / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Partial MAX-SAT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2786911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Consistency in Weighted CSPs and Inference in Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to efficient Max-SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Cycle Structures in Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Weighted Boolean Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Unsatisfiability-Based Algorithms for Boolean Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean lexicographic optimization: algorithms \& applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to Core-Guided Binary Search for MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On SAT Modulo Theories and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics—the metaphor exposed / rank
 
Normal rank

Revision as of 17:26, 13 July 2024

scientific article
Language Label Description Also known as
English
Exploiting subproblem optimization in SAT-based maxsat algorithms
scientific article

    Statements

    Exploiting subproblem optimization in SAT-based maxsat algorithms (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2017
    0 references
    constraint optimization
    0 references
    satisfiability
    0 references
    maximum satisfiability
    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
    0 references

    Identifiers