Abstract: This paper investigates the feasibility of fine-tuning a large language model (LLM), specifically ChatGPT, to tackle the Boolean satisfiability problem (3-SAT), a well-known NP-complete ...
Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback