New Tableau Characterizations for Non-clausal MaxSAT Problem

Logic Journal of the IGPL 30 (3):422-436 (2022)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A resolution calculus for MinSAT.Chu-Min Li, Fan Xiao & Felip Manyà - 2021 - Logic Journal of the IGPL 29 (1):28-44.

Analytics

Added to PP
2021-03-12

Downloads
3 (#1,519,925)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations