Arc-consistency and arc-consistency again
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing
Proceedings of the 2002 international symposium on Physical design
Computational Optimization and Applications
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Using weighted MAX-SAT engines to solve MPE
Eighteenth national conference on Artificial intelligence
Arc consistency for soft constraints
Artificial Intelligence
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Optimal Protein Structure Alignment Using Maximum Cliques
Operations Research
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
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
Artificial Intelligence
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Symmetry Breaking for Maximum Satisfiability
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Inference rules for high-order consistency in weighted CSP
AAAI'07 Proceedings of the 22nd 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
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
Structural relaxations by variable renaming and their compilation for solving MinCostSAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Some simplified forms of reasoning with distance-based entailments
Canadian AI'08 Proceedings of the Canadian Society for computational studies of intelligence, 21st conference on Advances in artificial intelligence
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
Resolution-based lower bounds in MaxSAT
Constraints
| Hi-index | 0.00 |
In this paper we augment the Max-SAT solver of (Larrosa & Heras 2005) with three new inference rules. The three of them are special cases of Max-SAT resolution with which better lower bounds and more value pruning is achieved. Our experimental results on several domains show that the resulting algorithm can be orders of magnitude faster than state-of-the-art Max-SAT solvers and the best Weighted CSP solver.