Algorithms for Weighted Boolean Optimization

DOI10.1007/978-3-642-02777-2_45zbMath1247.68258OpenAlexW1775352280MaRDI QIDQ3637182

Jordi Planes, João P. Marques-Silva, Vasco M. Manquinho

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_45

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Quantified maximum satisfiability ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ Algorithms for Solving Satisfiability Problems with Qualitative Preferences ⋮ Solving satisfiability problems with preferences ⋮ Logic tensor networks ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ Reformulation based MaxSat robustness ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ Learning discrete decomposable graphical models via constraint optimization ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Haplotype inference with pseudo-Boolean optimization ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ Extending linear relaxation for non-square matrices and soft constraints ⋮ A Propositional CONEstrip Algorithm ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ MiFuMax—a Literate MaxSAT Solver ⋮ RC2: an Efficient MaxSAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Proofs and Certificates for Max-SAT

Uses Software

• Pueblo
• PBS
• PicoSAT
• Sat4j
• MiniMaxSat

Cites Work

• A linear-time transformation of linear inequalities into conjunctive normal form
• Resolution for Max-SAT
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
• A logical approach to efficient Max-SAT solving
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Paths, Trees, and Flowers
• On Solving the Partial MAX-SAT Problem
• On SAT Modulo Theories and Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for Weighted Boolean Optimization