Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Optimization of large join queries: combining heuristics and combinatorial techniques
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
An optimal backtrack algorithm for tree-structured constraint satisfaction problems
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal of Artificial Intelligence Research
Taking advantage of stable sets of variables in constraint satisfaction problems
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A non-deterministic semantics for tractable inference
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Maintenance scheduling problems as benchmarks for constraint algorithms
Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Nonsystematic Search and No-Good Learning
Journal of Automated Reasoning
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
On Reformulating Planning as Dynamic Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Distributed Configuration as Distributed Dynamic Constraint Satisfaction
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Maintaining Arc-Consistency within Dynamic Backtracking
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Learning for quantified boolean logic satisfiability
Eighteenth national conference on Artificial intelligence
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Mixtures of deterministic-probabilistic networks and their AND/OR search space
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
AND/OR search spaces for graphical models
Artificial Intelligence
An explanation-based tools for debugging constraint satisfaction problems
Applied Soft Computing
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Performing incremental Bayesian inference by dynamic model counting
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
GIB: imperfect information in a computationally challenging game
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
A comparison of time-space schemes for graphical models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
TSAT++: an Open Platform for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Improving design-pattern identification: a new approach and an exploratory study
Software Quality Control
INFORMS Journal on Computing
AND/OR multi-valued decision diagrams for constraint optimization
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.00 |
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze the effects of polynomial-space-bounded learning on runtime complexity of backtrack search. One space-bounded learning scheme records only those constramts With limited size, and another records arbitrarily large constraints but deletes those that become irrelevant to the portion of the search space being explored. We find that relevance-bounded learning allows better runtime bounds than size-bounded learning on structurally restricted constraint satisfaction problems. Even when restricted to linear space, our relevance-bounded learning algorithm has runtime complexity near that of unrestricted (exponential space-consuming) learning schemes.