Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
New ideas for solving covering problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Constraint Processing
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Optimization algorithms for the minimum-cost satisfiability problem
Optimization algorithms for the minimum-cost satisfiability problem
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
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
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Journal of Artificial Intelligence Research
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
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Improved exact solvers for weighted Max-SAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Clone: solving weighted Max-SAT in a reduced search space
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Approximating weighted Max-SAT problems by compensating for relaxations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Resolution-based lower bounds in MaxSAT
Constraints
Solving satisfiability problems with preferences
Constraints
Relax, compensate and then recover: a theory of anytime, approximate inference
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
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
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit relaxations are seldom used. In this work, we consider the use of explicit relaxations for solving MinCostSAT, the problem of finding a minimum cost satisfying assignment. We start with the observation that while a number of SAT and CSP tasks have a complexity that is exponential in the treewidth, such models can be relaxed into weaker models of bounded treewidth by a simple form of variable renaming. The relaxed models can then be compiled in polynomial time and space, so that their solutions can be used effectively for pruning the search in the original problem. We have implemented a MinCostSAT solver using this idea on top of two off-the-shelf tools, a d-DNNF compiler that deals with the relaxation, and a SAT solver that deals with the search. The results over the entire suite of 559 problems from the 2006 Weighted Max-SAT Competition are encouraging: SR(w), the new solver, solves 56% of the problems when the bound on the relaxation treewidth is set to w = 8, while Toolbar, the winner, solves 73% of the problems, Lazy, the runner up, 55%, and MinCostChaff, a recent MinCostSAT solver, 26%. The relation between the proposed relaxation method and existing structural solution methods such as cutset decomposition and derivatives such as mini-buckets is also discussed.