On preprocessing for weighted MaxSAT

DOI10.1007/978-3-030-67067-2_25zbMath1472.68185OpenAlexW3118867283MaRDI QIDQ2234104

Tobias Paxian, Bernd Becker, Pascal Raiola

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67067-2_25

Mathematics Subject Classification ID

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

Related Items (1)

Clause redundancy and preprocessing in maximum satisfiability

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Boolean lexicographic optimization: algorithms \& applications
• Dynamic polynomial watchdog encoding for solving weighted MaxSAT
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Incremental inprocessing in SAT solving
• Core-boosted linear search for incomplete MaxSAT
• On Computing Backbones of Propositional Theories
• Algorithms for computing backbones of propositional formulae
• Multi‐objective combinatorial optimization problems: A survey
• Exact Algorithms for MAX-SAT
• The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
• Algorithm and bound for the greatest common divisor of n integers
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: On preprocessing for weighted MaxSAT