DRMaxSAT with MaxHS: First Contact
暂无分享,去创建一个
Joao Marques-Silva | Samuel R. Buss | Maria Luisa Bonet | Alexey Ignatiev | António Morgado | S. Buss | Joao Marques-Silva | Alexey Ignatiev | António Morgado
[1] Joao Marques-Silva,et al. MaxSAT Resolution With the Dual Rail Encoding , 2018, AAAI.
[2] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[3] Toby Walsh,et al. Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .
[4] Daniel Le Berre,et al. The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..
[5] Vasco M. Manquinho,et al. Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.
[6] Joao Marques-Silva,et al. On Using Unsatisfiability for Solving Maximum Satisfiability , 2007, ArXiv.
[7] Maria Luisa Bonet,et al. SAT-based MaxSAT algorithms , 2013, Artif. Intell..
[8] Miyuki Koshimura,et al. QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..
[9] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[10] Maria Luisa Bonet,et al. Resolution for Max-SAT , 2007, Artif. Intell..
[11] Luigi Palopoli,et al. Algorithms for Selective Enumeration of Prime Implicants , 1999, Artif. Intell..
[12] Fahiem Bacchus,et al. Reduced Cost Fixing in MaxSAT , 2017, CP.
[13] Fahiem Bacchus,et al. Postponing Optimization to Speed Up MAXSAT Solving , 2013, CP.
[14] Vasco M. Manquinho,et al. Incremental Cardinality Constraints for MaxSAT , 2014, CP.
[15] Carsten Sinz,et al. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.
[16] Marijn J. H. Heule,et al. Extended Resolution Simulates DRAT , 2018, IJCAR.
[17] Fahiem Bacchus,et al. Solving MAXSAT by Solving a Sequence of Simpler SAT Instances , 2011, CP.
[18] Jakob Nordström,et al. Divide and Conquer: Towards Faster Pseudo-Boolean Solving , 2018, IJCAI.
[19] Sharad Malik,et al. On Solving the Partial MAX-SAT Problem , 2006, SAT.
[20] Joao Marques-Silva,et al. On Tackling the Limits of Resolution in SAT Solving , 2017, SAT.
[21] Armin Biere. Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .
[22] Joao Marques-Silva,et al. Core-Guided MaxSAT with Soft Cardinality Constraints , 2014, International Conference on Principles and Practice of Constraint Programming.
[23] Jinbo Huang,et al. Extended clause learning , 2010, Artif. Intell..
[24] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[25] Nina Narodytska,et al. Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.
[26] Fahiem Bacchus,et al. Exploiting the Power of mip Solvers in maxsat , 2013, SAT.
[27] Gilles Audemard,et al. A Restriction of Extended Resolution for Clause Learning SAT Solvers , 2010, AAAI.
[28] Eliezer L. Lozinskii,et al. Consistent subsets of inconsistent systems: structure and behaviour , 2003, J. Exp. Theor. Artif. Intell..
[29] Armin Biere. Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling , 2014, POS@SAT.
[30] Joao Marques-Silva,et al. Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.
[31] Randal E. Bryant,et al. COSMOS: a compiled simulator for MOS circuits , 1987, DAC '87.
[32] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[33] Alexey Ignatiev,et al. MSCG: Robust Core-Guided MaxSAT Solving , 2015, J. Satisf. Boolean Model. Comput..
[34] Matti Järvisalo,et al. LMHS: A SAT-IP Hybrid MaxSAT Solver , 2016, SAT.