Open-WBO: A Modular MaxSAT Solver,
暂无分享,去创建一个
[1] Adnan Darwiche,et al. A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.
[2] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[3] Pascal Rapicault,et al. Dependency management for the eclipse ecosystem: eclipse p2, metadata and resolution , 2009, IWOCE '09.
[4] Robert Nieuwenhuis,et al. Curriculum-based course timetabling with SAT and MaxSAT , 2012, Ann. Oper. Res..
[5] Albert Oliveras,et al. Practical algorithms for unsatisfiability proof and core generation in SAT solvers , 2010, AI Commun..
[6] Mikolás Janota,et al. PackUp: Tools for Package Upgradability Solving , 2012, J. Satisf. Boolean Model. Comput..
[7] Josep Argelich,et al. Boolean lexicographic optimization: algorithms & applications , 2011, Annals of Mathematics and Artificial Intelligence.
[8] Joao Marques-Silva,et al. Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007, SAT.
[9] Gilles Audemard,et al. Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.
[10] Vasco M. Manquinho,et al. Algorithms for Weighted Boolean Optimization , 2009, SAT.
[11] Sharad Malik,et al. On Solving the Partial MAX-SAT Problem , 2006, SAT.
[12] Felip Manyà,et al. MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.
[13] Maria Luisa Bonet,et al. Improving SAT-Based Weighted MaxSAT Solvers , 2012, CP.
[14] Oliver Kullmann,et al. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.
[15] Michela Milano. Proceedings of the 18th international conference on Principles and Practice of Constraint Programming , 2012 .
[16] Antonio Krüger,et al. KI 2012: Advances in Artificial Intelligence , 2012, Lecture Notes in Computer Science.
[17] Miyuki Koshimura,et al. QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..
[18] Steffen Hölldobler,et al. A Compact Encoding of Pseudo-Boolean Constraints into SAT , 2012, KI.
[19] Marcelo Finger,et al. Advances in Artificial Intelligence - SBIA 2012 , 2012, Lecture Notes in Computer Science.
[20] David Zuckerman,et al. Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[21] Carlos Ansótegui,et al. Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.
[22] Marijn J. H. Heule,et al. Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions , 2017 .
[23] Matti Järvisalo,et al. Theory and Applications of Satisfiability Testing – SAT 2013 , 2013, Lecture Notes in Computer Science.
[24] Joao Marques-Silva,et al. Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.
[25] Gilles Audemard,et al. Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.
[26] Albert Oliveras,et al. Cardinality Networks: a theoretical and empirical study , 2011, Constraints.
[27] Daniel Le Berre,et al. The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..
[28] David G. Mitchell,et al. Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing , 2004 .
[29] Vasco M. Manquinho,et al. On Partitioning for Maximum Satisfiability , 2012, ECAI.
[30] Maria Luisa Bonet,et al. Solving (Weighted) Partial MaxSAT through Satisfiability Testing , 2009, SAT.
[31] Miyuki Koshimura,et al. Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.
[32] Armin Biere,et al. Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.