Výsledky vyhledávání - "Buss, Samuel"

Report

Next-Token Prediction Task Assumes Optimal Data Ordering for LLM Training in Proof Generation

Autor: An, Chenyang, Imani, Shima, Yao, Feng, Dong, Chengyu, Abbasi, Ali, Shrivastava, Harsh, Buss, Samuel, Shang, Jingbo, Mahalingam, Gayathri, Sharma, Pramod, Diesendruck, Maurice

In the field of large language model (LLM)-based proof generation, despite being trained on extensive corpora such as OpenWebMath and Arxiv, these models still exhibit only modest performance on proving tasks of moderate difficulty. We believe that t

Externí odkaz: http://arxiv.org/abs/2411.00863

Zobrazit plný text záznamu

Kniha

3-D computer graphics : a mathematical introduction with OpenGL / Samuel R. Buss. [elektronicky zdroj]

Autor: Buss, Samuel R., author

Externí odkaz: Kolekce e-knih KNAV

Report

Small Stone in Pool

Autor: Buss, Samuel R., Kolodziejczyk, Leszek Aleksander

Publikováno v: Logical Methods in Computer Science, Volume 10, Issue 2 (June 27, 2014) lmcs:852

The Stone tautologies are known to have polynomial size resolution refutations and require exponential size regular refutations. We prove that the Stone tautologies also have polynomial size proofs in both pool resolution and the proof system of regu

Externí odkaz: http://arxiv.org/abs/1405.5626

Zobrazit plný text záznamu

Report

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning

Autor: Buss, Samuel R., Hoffmann, Jan, Johannsen, Jan

Publikováno v: Logical Methods in Computer Science, Volume 4, Issue 4 (December 5, 2008) lmcs:860

Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an exponential separat

Externí odkaz: http://arxiv.org/abs/0811.1075

Zobrazit plný text záznamu

Report

The prospects for mathematical logic in the twenty-first century

Autor: Buss, Samuel R., Kechris, Alexander S., Pillay, Anand, Shore, Richard A.

Publikováno v: Bulletin of Symbolic Logic 7 (2001) 169-196

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed indepe

Externí odkaz: http://arxiv.org/abs/cs/0205003

Zobrazit plný text záznamu