A taxonomy of exact methods for partial Max-SAT (Q2434567): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(12 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11390-013-1325-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: UnitWalk / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Alloy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sat4j / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniMaxSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QingTing1 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TestEra / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CBMC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ZRes / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11390-013-1325-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080871662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting complete techniques thanks to local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state of SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reasoning about equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Decision Procedure for Arithmetic with Function Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Combinations of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as satisfiability: parallel plans and algorithms for plan search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Protein Structure Alignment Using Maximum Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624109 / 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: Exploiting Cycle Structures in Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Inconsistent Clause-Subsets for Max-SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411139 / 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: Principles and Practice of Constraint Programming – CP 2003 / 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: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Weighted Boolean Optimization / 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: Q3624141 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11390-013-1325-5 / rank
 
Normal rank

Latest revision as of 15:09, 18 December 2024

scientific article
Language Label Description Also known as
English
A taxonomy of exact methods for partial Max-SAT
scientific article

    Statements

    A taxonomy of exact methods for partial Max-SAT (English)
    0 references
    6 February 2014
    0 references
    partial Max-SAT
    0 references
    Davis-Putnam-Logenmann-Loveland
    0 references
    branch and bound
    0 references
    unsatisfiability
    0 references
    pseudo-Boolean optimization
    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
    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
    0 references
    0 references

    Identifiers