Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Probing-Based Preprocessing Techniques for Propositional Satisfiability
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers
Annals of Mathematics and Artificial Intelligence
Study of lower bound functions for MAX-2-SAT
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Conflict directed backjumping for Max-CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Resolution in Max-SAT and its relation to local consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Local search algorithms for partial MAXSAT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Soft arc consistency applied to optimal planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Improved exact solvers for weighted Max-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
Symmetry Breaking for Maximum Satisfiability
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A new Approach for Solving Satisfiability Problems with Qualitative Preferences
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Exploiting Cycle Structures in Max-SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Soft arc consistency revisited
Artificial Intelligence
Partial max-SAT solvers with clause learning
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Modelling Max-CSP as partial Max-SAT
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A preprocessor for Max-SAT solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Towards more effective unsatisfiability-based maximum satisfiability algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Supporting privacy preferences in credential-based interactions
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 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
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
Artificial Intelligence
| Hi-index | 0.00 |
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in Max-SAT) as well as pseudo-boolean objective functions and constraints. Its main features are: learning and backjumping on hard clauses; resolution-based and subtraction-based lower bounding; and lazy propagation with the two-watched literals scheme. Our empirical evaluation on a wide set of optimization benchmarks indicates that its performance is usually close to the best specialized alternative and, in some cases, even better.