Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
An optimal backtrack algorithm for tree-structured constraint satisfaction problems
Artificial Intelligence
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
A wide-range efficient algorithm for minimal triangulation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
A sufficiently fast algorithm for finding close to optimal clique trees
Artificial Intelligence
Topological parameters for time-space tradeoff
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Conflict-directed backjumping revisited
Journal of Artificial Intelligence Research
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Backtracking through biconnected components of a constraint graph
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the adaptive control of a class of SISO dynamic hybrid systems
Applied Numerical Mathematics
AND/OR search spaces for graphical models
Artificial Intelligence
Search heuristics for constraint-aided embodiment design
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
A Decomposition Technique for Max-CSP
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Dynamic heuristics for backtrack search on tree-decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bounded search and symbolic inference for constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the adaptive control of a class of SISO dynamic hybrid systems
Applied Numerical Mathematics
Russian Doll search with tree decomposition
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
Exploiting problem structure for solution counting
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
The Knowledge Engineering Review
Decomposition of multi-operator queries on semiring-based graphical models
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the constraint networks. This mixed approach permits us to define a new framework for the enumeration, which we expect that it will benefit from the advantages of two approaches: a practical efficiency of enumerative algorithms and a warranty of a limited time complexity by an approximation of the tree-width of the constraint networks. Finally, experimental results allow us to show the advantages of this approach.