More efficient stochastic local search for satisfiability
暂无分享,去创建一个
Jun Liu | Guanfeng Wu | Yang Xu | Huimin Fu | Jun Liu | Huimin Fu | Guanfeng Wu | Yang Xu
[1] Xiaoyu Song,et al. Maxterm Covering for Satisfiability , 2012, IEEE Transactions on Computers.
[2] Vladimir Ulyantsev,et al. Extended Finite-State Machine Induction Using SAT-Solver , 2011, 2011 10th International Conference on Machine Learning and Applications and Workshops.
[3] Kaile Su,et al. CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability , 2017, Artif. Intell..
[4] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[5] Wei Wu,et al. Clause States Based Configuration Checking in Local Search for Satisfiability , 2015, IEEE Transactions on Cybernetics.
[6] Wei Wu,et al. Double Configuration Checking in Stochastic Local Search for Satisfiability , 2014, AAAI.
[7] Mario Vanhoucke,et al. Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers , 2011, Eur. J. Oper. Res..
[8] Shaowei Cai,et al. Local Search with Efficient Automatic Configuration for Minimum Vertex Cover , 2019, IJCAI.
[9] Kaile Su,et al. Improving WalkSAT for Random k-Satisfiability Problem with k > 3 , 2013, AAAI.
[10] Dantong Ouyang,et al. Deriving all minimal consistency-based diagnosis sets using SAT solvers , 2009 .
[11] Lukás Chrpa,et al. Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks , 2021, SOCS.
[12] Kaile Su,et al. Two Weighting Local Search for Minimum Vertex Cover , 2015, AAAI.
[13] Holger H. Hoos,et al. Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT , 2010, SAT.
[14] Shaowei Cai,et al. Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.
[15] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[16] Ilias S. Kotsireas,et al. Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture , 2020, J. Symb. Comput..
[17] Uwe Schöning,et al. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.
[18] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.
[19] Kaile Su,et al. Scoring Functions Based on Second Level Score for k-SAT with Long Clauses , 2014, J. Artif. Intell. Res..
[20] Shaowei Cai,et al. An effective variable selection heuristic in SLS for weighted Max-2-SAT , 2015, J. Heuristics.
[21] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[22] Thomas Stützle,et al. Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.
[23] Min Shi,et al. Reference sharing: a new collaboration model for cooperative coevolution , 2017, Journal of Heuristics.
[24] John Thornton,et al. Clause Weighting Local Search for SAT , 2005, Journal of Automated Reasoning.
[25] Kevin Leyton-Brown,et al. Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.
[26] Minghao Yin,et al. An efficient local search algorithm for the winner determination problem , 2017, J. Heuristics.
[27] Inês Lynce,et al. Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.
[28] Anuj Deshpande,et al. Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers , 2019, Biosyst..
[29] Kaile Su,et al. More efficient two-mode stochastic local search for random 3-satisfiability , 2014, Applied Intelligence.
[30] Shaowei Cai,et al. NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT , 2020, Comput. J..
[31] Shengxiang Yang,et al. Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems , 2017, IEEE Transactions on Cybernetics.
[32] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[33] Kristina Lundqvist,et al. Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver , 2007, MBT.
[34] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[35] Kaile Su,et al. Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[36] Shaowei Cai,et al. WCA: A weighting local search for constrained combinatorial test optimization , 2020, Inf. Softw. Technol..
[37] Liang Dong. AN EFFICIENT LOCAL SEARCH ALGORITHM FOR STRUCTURED SAT PROBLEMS , 1998 .
[38] Jun Liu,et al. Improving WalkSAT for Random 3-SAT Problems , 2020, J. Univers. Comput. Sci..
[39] Alexander Nadel,et al. Chronological Backtracking , 2018, International Conference on Theory and Applications of Satisfiability Testing.
[40] Hans van Maaren,et al. Look-Ahead Based SAT Solvers , 2009, Handbook of Satisfiability.
[41] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[42] Riccardo Zecchina,et al. Hiding solutions in random satisfiability problems: A statistical mechanics approach , 2001, Physical review letters.
[43] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[44] Kaile Su,et al. Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..
[45] Shaowei Cai,et al. Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT , 2018, IJCAI.
[46] Kaile Su,et al. Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation , 2015, Comput. J..
[47] Jun Liu,et al. Focused random walk with probability distribution for SAT with long clauses , 2020, Applied Intelligence.
[48] Rong Hu,et al. An Improved Adaptive Genetic Algorithm for Solving 3-SAT Problems Based on Effective Restart and Greedy Strategy , 2018, Int. J. Comput. Intell. Syst..
[49] Barbara König,et al. CoReS: A Tool for Computing Core Graphs via SAT/SMT Solvers , 2019, ICGT.
[50] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[51] Kaile Su,et al. Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking , 2012, ECAI.