413 search results - page 1 / 83 » Computing and Exploiting Tree-Decompositions for Solving Con... |
73
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
CP
2006
Springer
15 years 3 months ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
AAAI
1990
15 years 1 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...