Graphical evolution: an introduction to the theory of random graphs
Graphical evolution: an introduction to the theory of random graphs
Improving repair-based constraint satisfaction methods by value propagation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Exploiting the deep structure of constraint problems
Artificial Intelligence
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Constructing an asymptotic phase transition in random binary constraint satisfaction problems
Theoretical Computer Science - Phase transitions in combinatorial problems
On the Forward Checking Algorithm
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Scaling Effects in the CSP Phase Transition
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Optimization-based Heuristics for Maximal Constraint Satisfaction
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
Extracting constraint satisfaction subproblems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Constraint satisfaction as global optimization
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Bayes networks for estimating the number of solutions to a CSP
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Detecting unsatisfiable CSPs by coloring the micro-structure
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Summarizing CSP hardness with continuous probability distributions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Path-consistency: when space misses time
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A graph-based method for improving GSAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Models and thresholds for random constraint satisfaction problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
Annals of Mathematics and 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
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the average similarity degree between solutions of random k-SAT and random CSPs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
Saving Support-Checks Does Not Always Save Time
Artificial Intelligence Review
When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems
Artificial Intelligence Review
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
Resolution complexity of random constraint satisfaction problems: another half of the story
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Many hard examples in exact phase transitions
Theoretical Computer Science
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
From High Girth Graphs to Hard Instances
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the Efficiency of Impact Based Heuristics
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the Integration of Singleton Consistencies and Look-Ahead Heuristics
Recent Advances in Constraints
Beyond Singleton Arc Consistency
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Domain transmutation in constraint satisfaction problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generation of hard non-clausal random satisfiability problems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
A new general method to generate random modal formulae for testing decision procedures
Journal of Artificial Intelligence Research
Consistency and random constraint satisfaction models
Journal of Artificial Intelligence Research
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
Probabilistic consistency boosts MAC and SAC
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal refutations for constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reducing checks and revisions in coarse-grained MAC algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A simple model to generate hard satisfiable instances
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Solving dynamic constraint satisfaction problems by identifying stable features
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
An improved concurrent search algorithm for distributed CSPs
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An Empirical Study of the Manipulability of Single Transferable Voting
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Is computational complexity a barrier to manipulation?
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
Limited discrepancy search revisited
Journal of Experimental Algorithmics (JEA)
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
Hi-index | 0.00 |
A recent theoretical result by Achlioptas et al. shows that many models of random binary constraint satisfaction problems become trivially insoluble as problem size increases. This insolubility is partly due to the presence of ‘flawed variables,’ variables whose values are all ‘flawed’ (or unsupported). In this paper, we analyse how seriously existing work has been affected. We survey the literature to identify experimental studies that use models and parameters that may have been affected by flaws. We then estimate theoretically and measure experimentally the size at which flawed variables can be expected to occur. To eliminate flawed values and variables in the models currently used, we introduce a ‘flawless’ generator which puts a limited amount of structure into the conflict matrix. We prove that such flawless problems are not trivially insoluble for constraint tightnesses up to 1/2. We also prove that the standard models B and C do not suffer from flaws when the constraint tightness is less than the reciprocal of domain size. We consider introducing types of structure into the constraint graph which are rare in random graphs and present experimental results with such structured graphs.