Unifying tree decompositions for reasoning in graphical models

, , &
Artificial Intelligence 166 (1-2):165-193 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2005.04.004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,707

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Unifying the mind: Cognitive Representations as Graphical Models. [REVIEW]Christopher Burr - 2016 - Philosophical Psychology 29 (5):789-791.
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.
Importance sampling-based estimation over AND/OR search spaces for graphical models.Vibhav Gogate & Rina Dechter - 2012 - Artificial Intelligence 184-185 (C):38-77.
A cognitive theory of graphical and linguistic reasoning: Logic and implementation. Cognitive science.Keith Stenning & Jon Oberlander - 1995 - Cognitive Science 19 (1):97-140.
recenzja z: David Danks, 2014, Unifying the Mind: Cognitive Representations as Graphical Models, Cambridge, MA: The MIT Press, ss. xi + 287.Paweł Kawalec - 2015 - Zagadnienia Naukoznawstwa 51 (204).
Theory Unification and Graphical Models in Human Categorization.David Danks - 2010 - Causal Learning:173--189.
On the existence of regular types.Saharon Shelah & Steven Buechler - 1989 - Annals of Pure and Applied Logic 45 (3):277-308.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.
Default reasoning using classical logic.Rachel Ben-Eliyahu & Rina Dechter - 1996 - Artificial Intelligence 84 (1-2):113-150.
Tree models and (labeled) categorial grammar.Yde Venema - 1996 - Journal of Logic, Language and Information 5 (3-4):253-277.
Graphical models, causal inference, and econometric models.Peter Spirtes - 2005 - Journal of Economic Methodology 12 (1):3-34.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,106,082)

6 months
12 (#240,639)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.

Add more citations

References found in this work

Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.

View all 7 references / Add more references