Tree clustering for constraint networks (research note)
Artificial Intelligence
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
On programming of arithmetic operations
Communications of the ACM
A comparison of structural CSP decomposition methods
Artificial Intelligence
Information and Computation
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Space complexity of random formulae in resolution
Random Structures & Algorithms
Annals of Mathematics and Artificial Intelligence
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Random SAT Instances à la Carte
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Towards industrial-like random SAT instances
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
| Hi-index | 0.00 |
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelike resolution (also called hardness), the minimal size of strong backdoors and of cycle-cutsets, and the treewidth can be used for this purpose. We propose the use of the tree-like space complexity as a solid candidate to be the best measure for solvers based on DPLL. To support this thesis we provide a comparison with the other mentioned measures. We also conduct an experimental investigation to show how the proposed measure characterizes the hardness of random and industrial instances.