MaxSAT-based encodings for Group MaxSAT

DOI10.3233/AIC-140636zbMATH Open1373.68377OpenAlexW1566938367MaRDI QIDQ4589092FDOQ4589092

Authors: Federico Heras, Antonio Morgado, Joao Marques-Silva 

Publication date: 7 November 2017

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-140636

Recommendations

• Solving Max-SAT as weighted CSP
• Modelling Max-CSP as Partial Max-SAT
• Minimaxsat: an efficient weighted Max-SAT solver
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT

zbMATH Keywords

MaxSATBoolean optimizationGroup MaxSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Cited In (3)

• Minimal sets on propositional formulae. Problems and reductions
• LMHS: a SAT-IP hybrid MaxSat solver
• Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing

This page was built for publication: MaxSAT-based encodings for Group MaxSAT

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