José A. Alonso on Nostr: How to discover short, shorter, and the shortest proofs of unsatisfiability: A ...
How to discover short, shorter, and the shortest proofs of unsatisfiability: A branch-and-bound approach for resolution proof length minimization. ~ Konstantin Sidorov, Koos van der Linden, Gonçalo Homem de Almeida Correia, Mathijs de Weerdt, Emir Demirović.
https://arxiv.org/abs/2411.07955 #ATP #SAT_Solvers
Published at
2024-11-13 09:58:29Event JSON
{
"id": "154cdb7a399b5f2c2a6c8f21308e4107d55cf4721f8364a2da1068ac7c6e6272",
"pubkey": "0efb7bc903f4c6716cd4d07830d344d7abe5b607a156de3cde1ac1a5bf22ae1c",
"created_at": 1731491909,
"kind": 1,
"tags": [
[
"t",
"sat_solvers"
],
[
"t",
"atp"
],
[
"proxy",
"https://mathstodon.xyz/users/Jose_A_Alonso/statuses/113475053782460299",
"activitypub"
]
],
"content": "How to discover short, shorter, and the shortest proofs of unsatisfiability: A branch-and-bound approach for resolution proof length minimization. ~ Konstantin Sidorov, Koos van der Linden, Gonçalo Homem de Almeida Correia, Mathijs de Weerdt, Emir Demirović. https://arxiv.org/abs/2411.07955 #ATP #SAT_Solvers",
"sig": "fd09774291b95cf7da6b67d2d26e17a3b988214c78b6b07c2e9332607fd318b7f69b9a3e7f3edd173b80ebd6c15fd69a61c70f90d1d3384f2e28399be061a610"
}