A resolution calculus for MinSAT
暂无分享,去创建一个
[1] Djamal Habet,et al. On the Resiliency of Unit Propagation to Max-Resolution , 2015, IJCAI.
[2] Felip Manyà,et al. A MaxSAT-Based Approach to the Team Composition Problem in a Classroom , 2017, AAMAS Workshops.
[3] Nina Narodytska,et al. Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.
[4] Vasco M. Manquinho,et al. Algorithms for Weighted Boolean Optimization , 2009, SAT.
[5] Carlos Ansótegui,et al. Exploiting subproblem optimization in SAT-based MaxSAT algorithms , 2016, J. Heuristics.
[6] Felip Manyà,et al. An Exact Inference Scheme for MinSAT , 2015, IJCAI.
[7] Zhu Zhu,et al. A SAT-Based Approach to MinSAT , 2012, CCIA.
[8] Josep Argelich,et al. MinSAT versus MaxSAT for Optimization Problems , 2013, CP.
[9] Kaile Su,et al. Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.
[10] Joao Marques-Silva,et al. Maximal falsifiability , 2016, AI Commun..
[11] Maria Luisa Bonet,et al. Inference Rules for High-Order Consistency in Weighted CSP , 2007, AAAI.
[12] Maria Luisa Bonet,et al. The Logic Behind Weighted CSP , 2007, IJCAI.
[13] Alexey Ignatiev,et al. On Reducing Maximum Independent Set to Minimum Satisfiability , 2014, SAT.
[14] Maria Luisa Bonet,et al. Resolution for Max-SAT , 2007, Artif. Intell..
[15] Reiner Hähnle,et al. Advanced Many-Valued Logics , 2001 .
[16] Vasco M. Manquinho,et al. Parallel Maximum Satisfiability , 2018, Handbook of Parallel Constraint Reasoning.
[17] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[18] Felip Manyà,et al. Resolution-based lower bounds in MaxSAT , 2010, Constraints.
[19] Reiner Hähnle,et al. The SAT problem of signed CNF formulas , 2000 .
[20] Maria Luisa Bonet,et al. A Complete Calculus for Max-SAT , 2006, SAT.
[21] Maria Luisa Bonet,et al. A Complete Resolution Calculus for Signed Max-SAT , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).
[22] Sharad Malik,et al. On Solving the Partial MAX-SAT Problem , 2006, SAT.
[23] Reiner Hähnle. Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..
[24] Josep Argelich,et al. A New Encoding from MinSAT into MaxSAT , 2012, CP.
[25] Maria Luisa Bonet,et al. Resolution procedures for multiple-valued optimization , 2013, Inf. Sci..
[26] Christian G. Fermüller,et al. Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..
[27] Josep Argelich,et al. The First and Second Max-SAT Evaluations , 2008, J. Satisf. Boolean Model. Comput..
[28] Joao Marques-Silva,et al. On Tackling the Limits of Resolution in SAT Solving , 2017, SAT.
[29] Zhu Zhu,et al. Minimum Satisfiability and Its Applications , 2011, IJCAI.
[30] Zhu Zhu,et al. Optimizing with minimum satisfiability , 2012, Artif. Intell..
[31] Teresa Alsinet,et al. A Max-SAT Solver with Lazy Data Structures , 2004, IBERAMIA.
[32] Felip Manyà,et al. MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.
[33] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[34] Neil V. Murray,et al. Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas , 1994, Fundam. Informaticae.
[35] Reiner Hähnle,et al. Deduction in many-valued logics: a survey , 1997 .