WPM3: an (in)complete algorithm for weighted partial MaxSAT
type: Item
instance of: scholarly article
title: WPM3: an (in)complete algorithm for weighted partial MaxSAT
zbMATH Open document ID: 1419.68090
author: Carlos Ansótegui
author: Joel Gabàs
published in: Artificial Intelligence
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6807697
zbMATH Keywords: optimization
zbMATH Keywords: MaxSAT
zbMATH Keywords: SAT
zbMATH Keywords: pseudo-Boolean constraints
describes a project that uses: MiniMaxSat
describes a project that uses: Sat4j
describes a project that uses: CCLS
describes a project that uses: MiniSat
describes a project that uses: MaxHS
describes a project that uses: QMaxSAT
describes a project that uses: maxino
describes a project that uses: WPM2
MaRDI profile type: Publication
full work available at URL: j.artint.2017.05.003
OpenAlex ID: W2621108739
cites work: Optimal Protein Structure Alignment Using Maximum Cliques
cites work: Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information
cites work: Curriculum-based course timetabling with SAT and MaxSAT
cites work: A ``logic-constrained'' knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
cites work: Q3604009
cites work: SAT-based MaxSAT algorithms
cites work: Iterative and core-guided maxsat solving: a survey and assessment
cites work: New local search methods for partial MaxSAT
cites work: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
cites work: Exploiting subproblem optimization in SAT-based maxsat algorithms
cites work: Exploiting Cycle Structures in Max-SAT
cites work: Solving (Weighted) Partial MaxSAT through Satisfiability Testing
cites work: Algorithms for Weighted Boolean Optimization
cites work: Q3429154
cites work: QMaxSAT: A partial Max-SAT solver
cites work: Improvements to Core-Guided Binary Search for MaxSAT
cites work: Cardinality networks: a theoretical and empirical study
cites work: Unsatisfiability-based optimization in clasp
cites work: Theory and Applications of Satisfiability Testing
cites work: Resolution for Max-SAT
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: New Encodings of Pseudo-Boolean Constraints into CNF
cites work: MaxSAT by improved instance-specific algorithm configuration
cites work: Exploiting the Power of mip Solvers in maxsat
DOI: 10.1016/J.ARTINT.2017.05.003
description: scientific article; zbMATH DE number 6807697