Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Exploiting the deep structure of constraint problems
Artificial Intelligence
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
The Asymptotic Order of the Random k -SAT Threshold
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Implicit Random Constraint Satisfaction Problems
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Backjump-Based Techniques versus Conflict-Directed Heuristics
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Many hard examples in exact phase transitions
Theoretical Computer Science
Hiding satisfying assignments: two are better than one
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Domain filtering consistencies
Journal of Artificial Intelligence Research
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A Model to Study Phase Transition and Plateaus in Relational Learning
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Evaluating hybrid constraint tightening for scheduling agents
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
Empirical Study of Relational Learning Algorithms in the Phase Transition Framework
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
sgen1: A generator of small but difficult satisfiability benchmarks
Journal of Experimental Algorithmics (JEA)
Generalized solution techniques for preference-based constrained optimization with CP-nets
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
Maintaining Arc Consistency in Non-Binary Dynamic CSPs using Simple Tabular Reduction
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
Heuristic techniques for variable and value ordering in CSPs
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
A note on treewidth in random graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems
Journal of Mathematical Modelling and Algorithms
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Propagating soft table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
An optimal filtering algorithm for table constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
Variable-Centered Consistency in Model RB
Minds and Machines
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Automated generation of computationally hard feature models using evolutionary algorithms
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In this paper, we show that the models of random CSP instances proposed by Xu and Li [K. Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of Artificial Intelligence Research 12 (2000) 93-103; K. Xu, W. Li, Many hard examples in exact phase transitions with application to generating hard satisfiable instances, Technical report, CoRR Report cs.CC/0302001, Revised version in Theoretical Computer Science 355 (2006) 291-302] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any arity since no particular structure has to be integrated, or property enforced, in such instances. Then, the existence of an asymptotic phase transition can be guaranteed while applying a limited restriction on domain size and on constraint tightness. In that case, a threshold point can be precisely located and all instances have the guarantee to be hard at the threshold, i.e., to have an exponential tree-resolution complexity. Next, a formal analysis shows that it is possible to generate forced satisfiable instances whose hardness is similar to unforced satisfiable ones. This analysis is supported by some representative results taken from an intensive experimentation that we have carried out, using complete and incomplete search methods.