SAT-Based Preprocessing for MaxSAT

DOI10.1007/978-3-642-45221-5_7zbMath1406.68108arXiv1310.2298OpenAlexW40823289MaRDI QIDQ2870118

Anton Belov, Antonio Morgado, João P. Marques-Silva

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2298

Mathematics Subject Classification ID

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

Related Items

Quantified maximum satisfiability, Speeding up MUS Extraction with Preprocessing and Chunking, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, LMHS: A SAT-IP Hybrid MaxSAT Solver, Clause redundancy and preprocessing in maximum satisfiability

Uses Software

• Plingeling
• PicoSAT
• PrecoSAT