Many hard examples for resolution
Journal of the ACM (JACM)
Constraint-based reasoning
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Automatic generation of some results in finite algebra
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A theoretical evaluation of selected backtracking algorithms
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Systematic versus stochastic constraint satisfaction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
The constrainedness knife-edge
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
Phase Transitions in Relational Learning
Machine Learning
On Algorithms for Decomposable Constraints
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Investigation of Variable Relationships in 3-SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Random Constraint Satisfaction: Theory Meets Practice
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Eighteenth national conference on Artificial intelligence
The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
Eighteenth national conference on Artificial intelligence
The Knowledge Engineering Review
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
Discrete Applied Mathematics
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The impact of balancing on problem hardness in a highly structured domain
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
SATzilla-07: the design and analysis of an algorithm portfolio for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
A bayesian approach to tackling hard computational problems
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
On generators of random quasigroup problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
The community structure of SAT formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
Recent progress on search and reasoning procedures has been driven by experimentation on computationally hard problem instances. Hard random problem distributions are an important source of such instances. Challenge problems from the area of finite algebra have also stimulated research on search and reasoning procedures. Nevertheless, the relation of such problems to practical applications is somewhat unclear. Realistic problem instances clearly have more structure than the random problem instances, but, on the other hand, they are not as regular as the structured mathematical problems. We propose a new benchmark domain that bridges the gap between the purely random instances and the highly structured problems, by introducing perturbations into a structured domain. We will show how to obtain interesting search problems in this manner, and how such problems can be used to study the robustness of search control mechanisms. Our experiments demonstrate that the performance of search strategies designed to mimic direct constructive methods degrade surprisingly quickly in the presence of even minor perturbations.