English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/158463
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

An Exact Inference Scheme for MinSAT

AuthorsLi, Chu Min; Manyà, Felip
KeywordsOptimal assignment
Min-SAT
Max-SAT
Inference rules
Exact inference
Multiset
Issue Date25-Jul-2015
PublisherAAAI Press
CitationIJCAI'15 Proceedings of the 24th International Conference on Artificial Intelligence: 1959-1965
AbstractWe describe an exact inference-based algorithm for the MinSAT problem. Given a multiset of clauses C, the algorithm derives as many empty clauses as the maximum number of clauses that can be falsified in C by applying finitely many times an inference rule, and returns an optimal assignment. We prove the correctness of the algorithm, describe how it can be extended to deal with weighted MinSAT and weighted partial MinSAT instances, analyze the differences between the MaxSAT and MinSAT inference schemes, and define and empirically evaluate the MinSAT Pure Literal Rule.
URIhttp://hdl.handle.net/10261/158463
Identifiersisbn: 978-157735738-4
uri: https://www.ijcai.org/Proceedings/15/Papers/278.pdf
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
592782.null512,72 kBUnknownView/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.