New Tableau Characterizations for Non-clausal MaxSAT Problem

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.