SAT problems with chains of dependent variables

Authors:
Steven Prestwich
Affiliations:
Department of Computer Science, National University of Ireland at Cork, Cork, Ireland
Venue:
Discrete Applied Mathematics - The renesse issue on satisfiability
Year:
2003

Citing 22
Cited 8

Kaleidoscope: a cooperative menu-guided query interface (SQL version)

Proceedings of the sixth conference on Artificial intelligence applications
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study

Information Processing Letters
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Morphing: combining structure and randomness

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
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Coloration Neighbourhood Search With Forward Checking

Annals of Mathematics and Artificial Intelligence
SAT-Encodings, Search Space Structure, and Local Search Performance

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Reducing Epistasis in Combinatorial Problems by Expansive Coding

Proceedings of the 5th International Conference on Genetic Algorithms
Conflict Analysis in Search Algorithms for Satisfiability

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Backbone fragility and the local search cost peak

Journal of Artificial Intelligence Research
When gravity fails: local search topology

Journal of Artificial Intelligence Research
The Gn,mphase transition is not hard for the Hamiltonian cycle problem

Journal of Artificial Intelligence Research
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Systematic versus stochastic constraint satisfaction

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Algorithm portfolio design: theory vs. practice

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence

Accelerating Random Walks

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A SAT Approach to Query Optimization in Mediator Systems

Annals of Mathematics and Artificial Intelligence
Efficient SAT Techniques for Relative Encoding of Permutations with Constraints

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Variable dependency in local search: prevention Is better than cure

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem

Journal of Artificial Intelligence Research
Random walk with continuously smoothed variable weights

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A method to avoid duplicative flipping in local search for SAT

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Weight-enhanced diversification in stochastic local search for satisfiability

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper has two related themes. Firstly, artificial SAT problems are used to show that certain chains of variable dependency have a harmful effect on local search, sometimes causing exponential scaling on intrinsically easy problems. Secondly, systematic, local and hybrid SAT algorithms are evaluated on Hamiltonian cycle problems, exposing weaknesses in all three. The connection between the two themes is that some Hamiltonian cycle problems also cause local search to scale badly, indicating that pathological variable dependencies occur in more realistic applications. More generally, the results highlight the need for alternative models and search algorithms, and new examples of both are described.