A Clause Tableau Calculus for MinSAT
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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/155763 |
| Acceso en línea: | http://hdl.handle.net/10261/155763 |
| Access Level: | acceso abierto |
| Palabra clave: | SAT MinSAT Maxsat Clause |
| Sumario: | 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. |
|---|