As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We define a clause tableau calculus for MinSAT, and prove its soundness and completeness. The calculus allows one to compute the maximum number of clauses that can be falsified in a multiset of clauses by applying, finitely many times, tableaux-like inference rules. We also describe how the calculus can be extended to solve weighted MinSAT and weighted partial MinSAT.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.