"How To Discover Short, Shorter, and the Shortest Proofs of ..."

Konstantin Sidorov et al. (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2411.07955

access: open

type: Informal or Other Publication

metadata version: 2025-01-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2411-07955
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2411-07955
Konstantin Sidorov, Koos van der Linden, Gonçalo Homem De Almeida Correia, Mathijs de Weerdt, Emir Demirovic:
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization. CoRR abs/2411.07955 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.