Resizing cardinality constraints for MaxSAT

DOI10.3233/AIC-180768zbMATH Open1462.68175OpenAlexW2803778482WikidataQ129890347 ScholiaQ129890347MaRDI QIDQ5145443FDOQ5145443

Eivind Jahren, Achá Roberto Asín

Publication date: 20 January 2021

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

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

zbMATH Keywords

MaxSATcardinality encoding

Mathematics Subject Classification ID

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

Cites Work

• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003
• QMaxSAT: A partial Max-SAT solver
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• On Solving the Partial MAX-SAT Problem
• Title not available (Why is that?)
• Sorting in \(c \log n\) parallel steps
• Open-WBO: A Modular MaxSAT Solver,
• Title not available (Why is that?)
• Exploiting the Power of mip Solvers in maxsat
• Cardinality networks: a theoretical and empirical study
• A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
• Pairwise Cardinality Networks

Uses Software

• MiniSat
• QMaxSAT
• Open-WBO

This page was built for publication: Resizing cardinality constraints for MaxSAT

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