A machine program for theorem-proving
Communications of the ACM
Computational Optimization and Applications
Using weighted MAX-SAT engines to solve MPE
Eighteenth national conference on Artificial intelligence
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Optimal Protein Structure Alignment Using Maximum Cliques
Operations Research
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Many hard examples in exact phase transitions
Theoretical Computer Science
Discrete Applied Mathematics
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
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
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
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 inconsistent clause-subsets for Max-SAT solving
CP'07 Proceedings of the 13th 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
Parallel search for maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
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”
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
| Hi-index | 0.00 |
In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, which are not equivalent but Λ-equivalent, are proposed, and we show that Λ-equivalent rules are also sound. As an example, we show how to exploit inference rules to achieve a new lower bound function for a MAX-2-SAT solver. Our new function is admissible and consistently better than the well-known lower bound function. Based on the study of inference rules, we implement an efficient solver and the experimental results demonstrate that our solver outperforms the most efficient solver that has been implemented very recently [Heras and Larrosa, 2006], especially for large instances.