In this paper we provide a non-clausal tableau calculus for the minimum satisfiability problem. Moreover we describe how to adapt it to some variants. Our starting point is a calculus for non-clausal maximum satisfiability problem.
Fiorino, G. (2022). A non-clausal tableau calculus for MINSAT. INFORMATION PROCESSING LETTERS, 173(January 2022) [10.1016/j.ipl.2021.106167].
A non-clausal tableau calculus for MINSAT
Fiorino G.
2022
Abstract
In this paper we provide a non-clausal tableau calculus for the minimum satisfiability problem. Moreover we describe how to adapt it to some variants. Our starting point is a calculus for non-clausal maximum satisfiability problem.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Fiorino-2022- Inf Process Lett-VoR.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
271.26 kB
Formato
Adobe PDF
|
271.26 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.
