In this paper, we provide non-clausal tableau calculi for the maximum satisfiability problem and its variants. We discuss both basic calculi to characterize the problem and their modifications to reduce the proof size.
Fiorino, G. (2022). New Tableau Characterizations for Non-clausal MaxSAT Problem. LOGIC JOURNAL OF THE IGPL, 30(3), 422-436 [10.1093/jigpal/jzab012].
New Tableau Characterizations for Non-clausal MaxSAT Problem
Fiorino, G
2022
Abstract
In this paper, we provide non-clausal tableau calculi for the maximum satisfiability problem and its variants. We discuss both basic calculi to characterize the problem and their modifications to reduce the proof size.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Fiorino-2022-Log J IGPL-VoR.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
957.07 kB
Formato
Adobe PDF
|
957.07 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
