On Inconsistent Clause-Subsets for Max-SAT Solving

DOI10.1007/978-3-540-74970-7_18zbMath1145.68509OpenAlexW1509398350MaRDI QIDQ3523061

Gilles Dequen, Chu-Min Li, Sylvain Darras, Laure Devendeville

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_18

zbMATH Keywords

unit propagationMax-SATinconsistent subset

Mathematics Subject Classification ID

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

Related Items (6)

MaxSAT by improved instance-specific algorithm configuration ⋮ Resolution-based lower bounds in MaxSAT ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ Exploiting Cycle Structures in Max-SAT ⋮ Algorithms for Weighted Boolean Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining reversible DAC for Max-CSP
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Exact Max-SAT solvers for over-constrained problems
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• New Bounds for Oblivious Mesh Routing
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: On Inconsistent Clause-Subsets for Max-SAT Solving