How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sidorov, Konstantin, van der Linden, Koos, Correia, Gonçalo Homem de Almeida, de Weerdt, Mathijs, Demirović, Emir
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence I.2.8
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2411.07955