Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT
暂无分享,去创建一个
[1] Joao Marques-Silva,et al. Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.
[2] Vasco M. Manquinho,et al. Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.
[3] Fahiem Bacchus,et al. Relaxation Search: A Simple Way of Managing Optional Clauses , 2014, AAAI.
[4] Anthony G. Cohn,et al. Proceedings of the 19th national conference on Artifical intelligence , 2004 .
[5] Mikolás Janota,et al. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence On Computing Minimal Correction Subsets , 2022 .
[6] Éric Grégoire,et al. An Experimentally Efficient Method for (MSS, CoMSS) Partitioning , 2014, AAAI.
[7] Shaowei Cai,et al. From Decimation to Local Search and Back: A New Approach to MaxSAT , 2017, IJCAI.
[8] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[9] Kaile Su,et al. CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability , 2017, Artif. Intell..
[10] Carlos Ansótegui,et al. WPM3: An (in)complete algorithm for weighted partial MaxSAT , 2017, Artif. Intell..
[11] Shaowei Cai,et al. Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.
[12] Joao Marques-Silva,et al. Literal-Based MCS Extraction , 2015, IJCAI.
[13] Wei Wu,et al. CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.
[14] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .