Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
From MaRDI portal
Publication:3502710
DOI10.1007/978-3-540-79719-7_21zbMath1138.68548MaRDI QIDQ3502710
Vasco M. Manquinho, João P. Marques-Silva
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/265228/1/jpms-sat08a.pdf
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Boolean lexicographic optimization: algorithms \& applications, Iterative and core-guided maxsat solving: a survey and assessment, A taxonomy of exact methods for partial Max-SAT, Solving (Weighted) Partial MaxSAT through Satisfiability Testing, Generalizing Core-Guided Max-SAT, Algorithms for Weighted Boolean Optimization
Uses Software
Cites Work