Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Esposo, Chris"'
We theoretically and empirically study the logical reasoning capabilities of LLMs in the context of the Boolean satisfiability (SAT) problem. First, we construct a decoder-only Transformer that can solve SAT using backtracking and deduction via Chain
Externí odkaz:
http://arxiv.org/abs/2410.07432
