Exploiting Cycle Structures in Max-SAT

DOI10.1007/978-3-642-02777-2_43zbMath1247.68256MaRDI 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

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

Related Items

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

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