Fetching the paper…
Reading the bibliography…
Conflict-Driven Clause Learning (CDCL) is the mainstream framework for solving the Satisfiability problem (SAT), and CDCL solvers typically rely on various heuristics, which have a significant impact on their performance.
Genetic algorithms in search, optimization, and machine learning
Golberg, D. E. (1989) · 1989
Earlier work this paper cites.
Solving propositional satisfiability problems
Jeroslow, R. G., and Wang, J. (1990) · 1990
Earlier work this paper cites.
Optimal speedup of las vegas algorithms
Luby, M., Sinclair, A., and Zuckerman, D. (1993) · 1993
Earlier work this paper cites.
Boosting complete techniques thanks to local search methods
Mazure, B., Sais, L., and Grégoire, É. (1998) · 1998
Earlier work this paper cites.
Local search algorithms for sat: An empirical evaluation
Hoos, H. H., and Stützle, T. (2000) · 2000
Earlier work this paper cites.
Drift analysis and average time complexity of evolutionary algorithms
He, J., and Yao, X. (2001) · 2001
Earlier work this paper cites.
Theoretical aspects of evolutionary algorithms
Wegener, I. (2001) · 2001
Earlier work this paper cites.
A hybrid approach for sat
Habet, D., Li, C. M., Devendeville, L., and Vasquez, M. (2002) · 2002
Earlier work this paper cites.
Improvements to hybrid incremental sat algorithms
Letombe, F., and Marques-Silva, J. (2008) · 2008
Earlier work this paper cites.
Practical applications of boolean satisfiability
Marques-Silva, J. (2008) · 2008
Earlier work this paper cites.
Predicting learnt clauses quality in modern sat solvers
Audemard, G., and Simon, L. (2009) · 2009
Earlier work this paper cites.
Conflict-driven clause learning sat solvers
Biere, A., Heule, M., van Maaren, H., and Walsh, T. (2009) · 2009
Earlier work this paper cites.
Boosting local search thanks to cdcl
Audemard, G., Lagniez, J.-M., Mazure, B., and Sais, L. (2010) · 2010
Earlier work this paper cites.
Improving stochastic local search for sat with a new probability distribution
Balint, A., and Fröhlich, A. (2010) · 2010
Earlier work this paper cites.
Lingeling, plingeling, picosat and precosat at sat race 2010
Biere, A. (2010) · 2010
Earlier work this paper cites.
Optimal fixed and adaptive mutation rates for the leadingones problem
Böttcher, S., Doerr, B., and Neumann, F. (2010) · 2010
Earlier work this paper cites.
Black-box optimization benchmarking of newuoa compared to bipop-cma-es: on the bbob noiseless testbed
Hansen, N., and Ros, R. (2010) · 2010
Earlier work this paper cites.
Minisat 2.2 and minisat++ 1.1
Sörensson, N. (2010) · 2010
Earlier work this paper cites.
Between restarts and backjumps
Ramos, A., Van Der Tak, P., and Heule, M. J. (2011) · 2011
Earlier work this paper cites.
Glucose 2.1: Aggressive, but reactive, clause database management, dynamic restarts (system description)
Audemard, G., and Simon, L. (2012) · 2012
Earlier work this paper cites.
Overview and analysis of the sat challenge 2012 solver competition
Balint, A., Belov, A., Järvisalo, M., and Sinz, C. (2015) · 2012
Earlier work this paper cites.
Multiplicative drift analysis
Doerr, B., Johannsen, D., and Winzen, C. (2012) · 2012
Cited alongside, same era.
Strangenight
Soos, M. (2013) · 2013
Cited alongside, same era.
Tight bounds on the optimization time of a randomized search heuristic on linear functions
Witt, C. (2013) · 2013
Cited alongside, same era.
Evaluating cdcl restart schemes
Biere, A., and Fröhlich, A. (2015) · 2015
Cited alongside, same era.
Constraint solving and planning with Picat
Zhou, N.-F., Kjellerstrand, H., and Fruhman, J. (2015) · 2015
Cited alongside, same era.
Learning rate based branching heuristic for sat solvers
Liang, J. H., Ganesh, V., Poupart, P., and Czarnecki, K. (2016) · 2016
Cited alongside, same era.
Evolutionary algorithms for parameter optimization—thirty years later
Bäck, T. H., Kononova, A. V., van Stein, B., Wang, H., Antonov, K. A., Kalkreuth, R. T., de Nobel, J., Vermetten, D., de Winter, R., and Ye, F. (2023) · 2023
Later among the works it cites.
Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions
Balyo, T., Heule, M., Iser, M., Järvisalo, M., and Suda, M. (Eds.). (2023a) · 2023
Later among the works it cites.
The results of sat competition 2023
Balyo, T., Heule, M., Iser, M., Järvisalo, M., and Suda, M. (2023b) · 2023
Later among the works it cites.
Agentverse: Facilitating multi-agent collaboration and exploring emergent behaviors
Chen, W., Su, Y., Zuo, J., Yang, C., Yuan, C., Chan, C.-M., Yu, H., Lu, Y., Hung, Y.-H., Qian, C., et al. (2023) · 2023
Later among the works it cites.
The complexity of theorem-proving procedures
Cook, S. A. (2023) · 2023
Later among the works it cites.
Flows: Building blocks of reasoning and collaborating ai.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1+ λ \lambda ) ea variants on onemax and leadingones
Doerr, C., Ye, F., van Rijn, S., Wang, H., and Bäck, T. (2018) · 2018
Cited alongside, same era.
Hyper-heuristics: theory and applications
Pillay, N., and Qu, R. (2018) · 2018
Cited alongside, same era.
Cadical at the sat race 2019
Biere, A. (2019) · 2019
Cited alongside, same era.
Theory of evolutionary computation: Recent developments in discrete optimization
Doerr, B., and Neumann, F. (2019) · 2019
Cited alongside, same era.
MapleLCMDistChronoBT-DL, duplicate learnts heuristic-aided solvers at the sat race 2019
Kochemazov, S., Zaikin, O., Kondratiev, V., and Semenov, A. (2019) · 2019
Cited alongside, same era.
Benchmarking discrete optimization heuristics with iohprofiler
Doerr, C., Ye, F., Horesh, N., Wang, H., Shir, O., and Back, T. (2020) · 2020
Cited alongside, same era.
Josifoski, M., Klein, L., Peyrard, M., Li, Y., Geng, S., Schnitzler, J. P., Yao, Y., Wei, J., Paul, D., and West, R. (2023) · 2023
Later among the works it cites.
A comprehensive overview of large language models
Naveed, H., Khan, A. U., Qiu, S., Saqib, M., Anwar, S., Usman, M., Akhtar, N., Barnes, N., and Mian, A. (2023) · 2023
Later among the works it cites.
Openai api documentation
OpenAI (2023) · 2023
Later among the works it cites.
AutoGen: Enabling next-gen llm applications via multi-agent conversation framework
Wu, Q., Bansal, G., Zhang, J., Wu, Y., Zhang, S., Zhu, E., Li, B., Jiang, L., Zhang, X., and Wang, C. (2023) · 2023
Later among the works it cites.
Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling
Zhang, F., Mei, Y., Nguyen, S., and Zhang, M. (2023) · 2023
Later among the works it cites.
A Q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation
Zhang, Z.-Q., Wu, F.-C., Qian, B., Hu, R., Wang, L., and Jin, H.-P. (2023) · 2023
Later among the works it cites.
Iohexperimenter: Benchmarking platform for iterative optimization heuristics
de Nobel, J., Ye, F., Vermetten, D., Wang, H., Doerr, C., and Bäck, T. (2024) · 2024
Closest in time.
L-autoda: Leveraging large language models for automated decision-based adversarial attacks.
Guo, P., Liu, F., Lin, X., Zhao, Q., and Zhang, Q. (2024) · 2024
Closest in time.
Swiftsage: A generative agent with fast and slow thinking for complex interactive tasks
Lin, B. Y., Fu, Y., Yang, K., Brahman, F., Huang, S., Bhagavatula, C., Ammanabrolu, P., Choi, Y., and Ren, X. (2024) · 2024
Closest in time.
Evolution of heuristics: Towards efficient automatic algorithm design using large language model
Liu, F., Xialiang, T., Yuan, M., Lin, X., Luo, F., Wang, Z., Lu, Z., and Zhang, Q. (2024) · 2024
Closest in time.
Using an llm to help with code understanding
Nam, D., Macvean, A., Hellendoorn, V., Vasilescu, B., and Myers, B. (2024) · 2024
Closest in time.
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · 2024
Closest in time.
LLaMEA: A large language model evolutionary algorithm for automatically generating metaheuristics
van Stein, N., and Bäck, T. (2024) · 2024
Closest in time.
Evolve cost-aware acquisition functions using large language models
Yao, Y., Liu, F., Cheng, J., and Zhang, Q. (2024) · 2024
Closest in time.
Reevo: Large language models as hyper-heuristics with reflective evolution
Ye, H., Wang, J., Cao, Z., and Song, G. (2024) · 2024
Closest in time.
Understanding the importance of evolutionary search in automated heuristic design with large language models
Zhang, R., Liu, F., Lin, X., Wang, Z., Lu, Z., and Zhang, Q. (2024) · 2024
Closest in time.