Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics
A logical approach to efficient Max-SAT solving
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
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
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
Iterated robust tabu search for MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Partial max-SAT solvers with clause learning
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
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
On solving the partial MAX-SAT problem
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Preprocessing for controlled query evaluation with availability policy
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
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
On solving Boolean multilevel optimization problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An architecture for adaptive algorithmic hybrids
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Resolution-based lower bounds in MaxSAT
Constraints
Solving satisfiability problems with preferences
Constraints
Using learnt clauses in MAXSAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Journal of Automated Reasoning
Semiring-induced propositional logic: definition and basic algorithms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
An expressive and efficient solution to the service selection problem
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Learning web query patterns for imitating Wikipedia articles
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Tracing data errors with view-conditioned causality
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Pruning search space for weighted first order horn clause satisfiability
ILP'10 Proceedings of the 20th international conference on Inductive logic 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
Using SAT-Solvers to compute inference-proof database instances
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
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
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “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
A modular approach to MaxSAT modulo theories
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Exploiting the power of MIP solvers in MAXSAT
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
| Hi-index | 0.00 |
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MIN-ISAT+.It incorporates the best current 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 substraction-based lower bounding; and lazy propagation with the two-watched literal scheme. Our empirical evaluation comparing a wide set of solving alternatives on a broad set of optimization benchmarks indicates that the performance of MINIMAXSAT is usually close to the best specialized alternative and, in some cases, even better.