30 search results - page 1 / 6 » Unifying tree decompositions for reasoning in graphical mode... |
AI
2005
Springer
13 years 4 months ago
2005
Springer
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
IJCAI
2007
13 years 6 months ago
2007
We investigate three parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Adaptive Caching (AOC(i)); 2) Variabl...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
UAI
2004
13 years 6 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
IJAR
2006
13 years 4 months ago
2006
We describe a new graphical language for specifying asymmetric decision problems. The language is based on a filtered merge of several existing languages including sequential valu...