Exploiting Cycle Structures in Max-SAT

DOI10.1007/978-3-642-02777-2_43zbMath1247.68256OpenAlexW1607011516MaRDI QIDQ3637180

Nouredine Ould Mohamedou, Felip Manyà, Jordi Planes, Chu-Min Li

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_43

Mathematics Subject Classification ID

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

Related Items

Maximum likelihood model based on minor allele frequencies and weighted Max-SAT formulation for haplotype assembly, New local search methods for partial MaxSAT, Resolution-based lower bounds in MaxSAT, WPM3: an (in)complete algorithm for weighted partial MaxSAT, A new upper bound for Max-2-SAT: A graph-theoretic approach, MaxSAT resolution for regular propositional logic, Boosting branch-and-bound MaxSAT solvers with clause learning, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, A taxonomy of exact methods for partial Max-SAT, Learning hierarchical task network domains from partially observed plan traces, Breaking Cycle Structure to Improve Lower Bound for Max-SAT, CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Exploiting subproblem optimization in SAT-based maxsat algorithms, Extending linear relaxation for non-square matrices and soft constraints, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

Uses Software

• MiniMaxSat

Cites Work

• Unnamed Item
• Resolution for Max-SAT
• A logical approach to efficient Max-SAT solving
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• Local Consistency in Weighted CSPs and Inference in Max-SAT