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 tableau calculus for solving the Minimum Satisfiability problem for regular propositional logic, also known as Non-Clausal Regular MinSAT problem. Given a multiset of hard and weighted regular formulas Φ, the tableau calculus allows to find an assignment that satisfies the hard formulas and minimizes the sum of weights of the satisfied weighted regular formulas.
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.
loading subjects...
