暂无分享,去创建一个
[1] Mario Vanhoucke,et al. Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers , 2011, Eur. J. Oper. Res..
[2] Kevin Leyton-Brown,et al. Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.
[3] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[4] Lukás Chrpa,et al. Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks , 2021, SOCS.
[5] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[6] Ilias S. Kotsireas,et al. Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture , 2020, J. Symb. Comput..
[7] Wei Wu,et al. Clause States Based Configuration Checking in Local Search for Satisfiability , 2015, IEEE Transactions on Cybernetics.
[8] Dimitris Achlioptas,et al. Random Satisfiability , 2009, Handbook of Satisfiability.
[9] Lakhdar Sais,et al. Tabu Search for SAT , 1997, AAAI/IAAI.
[10] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[11] John Thornton,et al. Clause Weighting Local Search for SAT , 2005, Journal of Automated Reasoning.
[12] Uwe Schöning,et al. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.
[13] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[14] Kristina Lundqvist,et al. Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver , 2007, MBT.
[15] Wei Wu,et al. Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability , 2013, CP.
[16] Kaile Su,et al. More efficient two-mode stochastic local search for random 3-satisfiability , 2014, Applied Intelligence.
[17] Kaile Su,et al. Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..
[18] Kaile Su,et al. CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract) , 2017, IJCAI.
[19] Krzysztof Czarnecki,et al. An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate , 2017, SAT.
[20] Dantong Ouyang,et al. Deriving all minimal consistency-based diagnosis sets using SAT solvers , 2009 .
[21] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.
[22] Kaile Su,et al. Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation , 2015, Comput. J..
[23] Xiaoyu Song,et al. Maxterm Covering for Satisfiability , 2012, IEEE Transactions on Computers.
[24] Bart Selman,et al. An Empirical Study of Optimal Noise and Runtime Distributions in Local Search , 2010, SAT.
[25] Barbara König,et al. CoReS: A Tool for Computing Core Graphs via SAT/SMT Solvers , 2019, ICGT.
[26] Kevin Leyton-Brown,et al. SATenstein: Automatically Building Local Search SAT Solvers from Components , 2009, IJCAI.
[27] Kaile Su,et al. New local search methods for partial MaxSAT , 2016, Artif. Intell..
[28] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[29] Kaile Su,et al. Comprehensive Score: Towards Efficient Local Search for SAT with Long Clauses , 2013, IJCAI.
[30] Kaile Su,et al. Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking , 2012, ECAI.
[31] Anuj Deshpande,et al. Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers , 2019, Biosyst..
[32] Vladimir Ulyantsev,et al. Extended Finite-State Machine Induction Using SAT-Solver , 2011, 2011 10th International Conference on Machine Learning and Applications and Workshops.
[33] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[34] Riccardo Zecchina,et al. Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.
[35] Periklis A. Papakonstantinou,et al. Local Search for Hard SAT Formulas: The Strength of the Polynomial Law , 2016, AAAI.
[36] Abdul Sattar,et al. Weight-Enhanced Diversification in Stochastic Local Search for Satisfiability , 2013, IJCAI.
[37] Yu Li,et al. Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation) , 2012, SAT.
[38] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[39] Wei Wu,et al. Double Configuration Checking in Stochastic Local Search for Satisfiability , 2014, AAAI.
[40] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[41] Shengxiang Yang,et al. Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems , 2017, IEEE Transactions on Cybernetics.