On Solving the Partial MAX-SAT Problem

DOI10.1007/11814948_25zbMATH Open1187.68540OpenAlexW1531103278MaRDI QIDQ5756559

Sharad Malik, Zhaohui Fu

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11814948_25

Mathematics Subject Classification ID

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

Cited In (47)

• Solving #SAT and MAXSAT by Dynamic Programming
• Exploiting Resolution-Based Representations for MaxSAT Solving
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• A taxonomy of exact methods for partial Max-SAT
• Title not available (Why is that?)
• Quantified maximum satisfiability
• MaxSAT by improved instance-specific algorithm configuration
• Boolean lexicographic optimization: algorithms \& applications
• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• Curriculum-based course timetabling with SAT and MaxSAT
• A Preprocessor for Max-SAT Solvers
• Paracoherent answer set computation
• Propositional proof systems based on maximum satisfiability
• Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
• Minimization of Visibly Pushdown Automata Using Partial Max-SAT
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
• Modelling Max-CSP as Partial Max-SAT
• SAT-based optimal classification trees for non-binary data
• Community-Based Partitioning for MaxSAT Solving
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
• Resizing cardinality constraints for MaxSAT
• MiFuMax—a Literate MaxSAT Solver
• New local search methods for partial MaxSAT
• RC2: an Efficient MaxSAT Solver
• Iterative and core-guided maxsat solving: a survey and assessment
• An abstract view on optimizations in SAT and ASP
• Solving sparse instances of Max SAT via width reduction and greedy restriction
• Boosting branch-and-bound MaxSAT solvers with clause learning
• Certified Core-Guided MaxSAT Solving
• Maximum Constraint Satisfaction on Diamonds
• Incomplete inference for graph problems
• An abstract view on optimizations in propositional frameworks
• Proofs and Certificates for Max-SAT
• Formal methods for reasoning and uncertainty reduction in evidential grid maps
• A New Approach to Partial MUS Enumeration
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• Integrating multi-armed bandit with local search for MaxSAT
• Algorithms for Weighted Boolean Optimization
• Generalizing Core-Guided Max-SAT
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Mining top-\(k\) motifs with a SAT-based framework
• On an MCS-based inconsistency measure
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
• Exploiting subproblem optimization in SAT-based maxsat algorithms

Uses Software

• MiniSat
• CPLEX
• zChaff
• Chaff
• BerkMin
• Velev SAT Benchmarks

This page was built for publication: On Solving the Partial MAX-SAT Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756559)