Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Within-problem learning for efficient lower bound computation in Max-SAT solving
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
Exploiting inference rules to compute lower bounds for MAX-SAT solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Partial max-SAT solvers with clause learning
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
MiniMaxSAT: a new weighted Max-SAT solver
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On inconsistent clause-subsets for Max-SAT solving
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Towards more effective unsatisfiability-based maximum satisfiability algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Mapping problems with finite-domain variables to problems with boolean variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On solving the partial MAX-SAT problem
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Using learnt clauses in MAXSAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Reducing chaos in SAT-like search: finding solutions close to a given one
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Solving MAXSAT by solving a sequence of simpler SAT instances
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Boolean lexicographic optimization: algorithms & applications
Annals of Mathematics and Artificial Intelligence
Improving unsatisfiability-based algorithms for boolean optimization
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Efficient and accurate haplotype inference by combining parsimony and pedigree information
ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology
Read-once resolution for unsatisfiability-based Max-SAT algorithms
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Restoring CSP Satisfiability with MaxSAT
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Improvements to core-guided binary search for MaxSAT
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
An empirical study of encodings for group MaxSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Preference-Based planning via MaxSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Improving SAT-Based weighted MaxSAT solvers
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Clause sharing in parallel MaxSAT
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Artificial Intelligence
Reformulation based MaxSAT robustness
Constraints
Community-Based partitioning for MaxSAT solving
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Quantified maximum satisfiability: a core-guided approach
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Recently, Fu and Malik described an unweighted Partial MaxSAT solver based on successive calls to a SAT solver. At the k th iteration the SAT solver tries to certify that there exist an assignment that satisfies all but k clauses. Later Marques-Silva and Planes implemented and extended these ideas. In this paper we present and implement two Partial MaxSAT solvers and the weighted variant of one of them. Both are based on Fu and Malik ideas. We prove the correctness of our algorithm and compare our solver with other (Weighted) MaxSAT and (Weighted) Partial MaxSAT solvers.