ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Propositional satisfiability: techniques, algorithms and applications
AI Communications
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning
The Strangest Thing About Software
Computer
Discrete Applied Mathematics
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Optimizing requirements decisions with keys
Proceedings of the 4th international workshop on Predictor models in software engineering
SAT graph-based representation: A new perspective
Journal of Algorithms
Experimental studies of variable selection strategies based on constraint weights
Journal of Algorithms
Learning to assign degrees of belief in relational domains
Machine Learning
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A New Empirical Study of Weak Backdoors
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
A generative power-law search tree model
Computers and Operations Research
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Exploiting weak dependencies in tree-based search
Proceedings of the 2009 ACM symposium on Applied Computing
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
Backdoors to Combinatorial Optimization: Feasibility and Optimality
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
What Is a Real-World SAT Instance?
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
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
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Using expectation maximization to find likely assignments for solving CSP's
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The parameterized complexity of global constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Optimal refutations for constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Towards industrial-like random SAT instances
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Finding robust solutions in requirements models
Automated Software Engineering
Underapproximation for model-checking based on universal circuits
Information and Computation
Circuit based encoding of CNF formula
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Underapproximation for model-checking based on random cryptographic constructions
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
From horn strong backdoor sets to ordered strong backdoor sets
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Efficient recognition of acyclic clustered constraint satisfaction problems
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Accurate estimates without calibration?
ICSP'08 Proceedings of the Software process, 2008 international conference on Making globally distributed software development a success story
Computation of renameable Horn backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A new bound for an NP-hard subclass of 3-SAT using backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Benefits of a population: five mechanisms that advantage population-based algorithms
IEEE Transactions on Evolutionary Computation
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Sat-solving based on boundary point elimination
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Propelling SAT and SAT-based BMC using careset
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Beyond unit propagation in SAT solving
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Finding small backdoors in SAT instances
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
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
Tractable feedback vertex sets in restricted bipartite graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Randomization in constraint programming for airline planning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A backbone-based co-evolutionary heuristic for partial MAX-SAT
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Automatic extraction of functional dependencies
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Identifying and exploiting problem structures using explanation-based constraint programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
From approximate clausal reasoning to problem hardness
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
An overview of parallel SAT solving
Constraints
Activity-Based search for black-box constraint programming solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
The community structure of SAT formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The good, the bad, and the odd: cycles in answer-set programs
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Homomorphic hashing for sparse coefficient extraction
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Feedback vertex sets on restricted bipartite graphs
Theoretical Computer Science
INFORMS Journal on Computing
Detecting and exploiting subproblem tractability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Crowdsourcing backdoor identification for combinatorial optimization
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can handle combinatorial problems with up to a million variables and five million constraints. The good scaling behavior of these methods appears to defy what one would expect based on a worst-case complexity analysis. In order to bridge this gap between theory and practice, we propose a new framework for studying the complexity of these techniques on practical problem instances. In particular, our approach incorporates general structural properties observed in practical problem instances into the formal complexity analysis. We introduce a notion of "backdoors", which are small sets of variables that capture the overall combinatorics of the problem instance. We provide empirical results showing the existence of such backdoors in real-world problems. We then present a series of complexity results that explain the good scaling behavior of current reasoning and constraint methods observed on practical problem instances.