Integer and combinatorial optimization
Integer and combinatorial optimization
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Logic programming with pseudo-Boolean constraints
Constraint logic programming
Modern heuristic techniques for combinatorial problems
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Applying GSAT to non-clausal formulas
Journal of Artificial Intelligence Research
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Tuning local search for satisfiability testing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
An integer local search method with application to capacitated production planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
State-space planning by integer optimization
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Robust SAT-Based Search Algorithm for Leakage Power Reduction
PATMOS '02 Proceedings of the 12th International Workshop on Integrated Circuit Design. Power and Timing Modeling, Optimization and Simulation
Generic ILP versus specialized 0-1 ILP: an update
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Solving Hierarchical Constraints over Finite Domains with Local Search
Annals of Mathematics and Artificial Intelligence
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Integer optimization models of AI planning problems
The Knowledge Engineering Review
A SAT Approach to Query Optimization in Mediator Systems
Annals of Mathematics and Artificial Intelligence
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
Discrete Applied Mathematics
Solution and Optimization of Systems of Pseudo-Boolean Constraints
IEEE Transactions on Computers
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
Local-search techniques for boolean combinations of pseudo-boolean constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
Combining two local search approaches to hypergraph partitioning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Solving non-Boolean satisfiability problems with stochastic local search
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
An efficient model and strategy for the steel mill slab design problem
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The steel mill slab design problem revisited
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Pbmodels: software to compute stable models by pseudoboolean solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.01 |
Stochastic local search is one of the most successful methods for model finding in propositional satisfiability. However, many combinatorial problems have no concise propositional encoding. In this paper, we show that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operations research. We introduce the algorithm WSAT (PB) and demonstrate its potential in two case studies. The first application is an optimization problem from radar surveillance. Experiments on problems of realistic size show that WSAT (PB) is an efficient heuristic to find good approximate solutions. For most of the test problems, it found provably optimal solutions. In the second case study, we show that pseudo-Boolean local search can efficiently solve the progressive party problem, a problem that is hard for constraint programming with chronological backtracking, and whose 0-1 encoding is beyond the size limitations of integer linear programming.