On Solving the Partial MAX-SAT Problem
From MaRDI portal
Publication:5756559
DOI10.1007/11814948_25zbMath1187.68540MaRDI QIDQ5756559
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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Resizing cardinality constraints for MaxSAT, Quantified maximum satisfiability, MaxSAT by improved instance-specific algorithm configuration, New local search methods for partial MaxSAT, Boolean lexicographic optimization: algorithms \& applications, Curriculum-based course timetabling with SAT and MaxSAT, Mining top-\(k\) motifs with a SAT-based framework, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Exploiting subproblem optimization in SAT-based maxsat algorithms, Incomplete inference for graph problems, \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT, Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability, \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems, Iterative and core-guided maxsat solving: a survey and assessment, On an MCS-based inconsistency measure, Formal methods for reasoning and uncertainty reduction in evidential grid maps, A taxonomy of exact methods for partial Max-SAT, Minimization of Visibly Pushdown Automata Using Partial Max-SAT, Exploiting Resolution-Based Representations for MaxSAT Solving, A New Approach to Partial MUS Enumeration, Modelling Max-CSP as Partial Max-SAT, A Preprocessor for Max-SAT Solvers, Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms, Solving (Weighted) Partial MaxSAT through Satisfiability Testing, Generalizing Core-Guided Max-SAT, Algorithms for Weighted Boolean Optimization
Uses Software
