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.
Articolo in rivista - Articolo scientifico
Automatic theorem proving; Classical propositional logic; Minimum satisfiability problem; Tableaux;
English
22-lug-2021
2022
173
January 2022
106167
none
Fiorino, G. (2022). A non-clausal tableau calculus for MINSAT. INFORMATION PROCESSING LETTERS, 173(January 2022) [10.1016/j.ipl.2021.106167].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/323906
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 2
Social impact