6. UAI 1990: Cambridge, MA, USA

@proceedings{DBLP:conf/uai/1990,
  editor    = {Piero P. Bonissone and
               Max Henrion and
               Laveen N. Kanal and
               John F. Lemmer},
  title     = {UAI '90: Proceedings of the Sixth Annual Conference on Uncertainty
               in Artificial Intelligence, July 27-29, 1990, MIT, Cambridge,
               MA, USA},
  booktitle = {UAI},
  publisher = {Elsevier},
  year      = {1991},
  isbn      = {0-444-89264-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Michael P. Wellman:
  Exploiting functional dependencies in qualitative probabilistic reasoning. 3-16
  Electronic Edition (link) BibTeX
• Max Henrion, Marek J. Druzdzel:
  Qualtitative propagation and scenario-based scheme for exploiting probabilistic reasoning. 17-32
  Electronic Edition (link) BibTeX
• Thomas R. Shultz:
  Propagating uncertainty in rule based cognitive modelling. 33-40
  Electronic Edition (link) BibTeX
• Yizong Cheng:
  Context-dependent similarity. 41-50
  Electronic Edition (link) BibTeX
• David Heckerman:
  Similarity networks for the construction of multiple-faults belief networks. 51-64
  Electronic Edition (link) BibTeX
• Dan Geiger, David Heckerman:
  separable and transitive graphoids. 65-76
  Electronic Edition (link) BibTeX
• Dekang Lin, Randy Goebel:
  Integrating probabilistic, taxonomic and causal knowledge in abductive diagnosis. 77-88
  Electronic Edition (link) BibTeX
• David Poole, Gregory M. Provan:
  What is the most likely diagnosis? 89-106
  Electronic Edition (link) BibTeX
• Thomas D. Wu:
  Probabilistic evaluation of candidate sets for multidisorder diagnosis. 107-116
  Electronic Edition (link) BibTeX
• Edward Herskovits, Gregory F. Cooper:
  an entropy-driven system for construction of probabilistic expert systems from databases. 117-128
  Electronic Edition (link) BibTeX
• Jack S. Breese, Eric Horvitz:
  Ideal reformulation of belief networks. 129-144
  Electronic Edition (link) BibTeX
• David Einav, Michael R. Fehling:
  Computationally-optimal rea-resource strategies for independent, uninterruptible methods. 145-158
  Electronic Edition (link) BibTeX
• David Heckerman, Eric Horvitz:
  Problem formulation as the reduction of a decision model. 159-170
  Electronic Edition (link) BibTeX
• Robert P. Goldman, Eugene Charniak:
  Dynamic construction of belief networks. 171-184
  Electronic Edition (link) BibTeX
• Solomon Eyal Shimony, Eugene Charniak:
  A new algorithm for finding MAP assignments to belief networks. 185-196
  Electronic Edition (link) BibTeX
• Ross D. Shachter, Stig K. Andersen, Kim-Leng Poh:
  Directed reduction algorithms and decomposable graphs. 197-208
  Electronic Edition (link) BibTeX
• Wilson X. Wen:
  Optimal decomposition of belief networks. 209-224
  Electronic Edition (link) BibTeX
• Michelle Baker, Terrance E. Boult:
  Pruning bayesian networks for efficient computation. 225-232
  Electronic Edition (link) BibTeX
• Behzad Parviz:
  On heuristics for finding loop cutsets in multiply-connected belief networks. 233-244
  Electronic Edition (link) BibTeX
• Henri Jacques Suermondt, Gregory F. Cooper, David Heckerman:
  A combination of cutset conditioning with clique-tree propagation in the Pathfinder system. 245-254
  Electronic Edition (link) BibTeX
• Thomas Verma, Judea Pearl:
  Equivalence and synthesis of causal models. 255-270
  Electronic Edition (link) BibTeX
• Enrique H. Ruspini:
  Possibility as similarity; the semantics of fuzzy logic. 271-280
  Electronic Edition (link) BibTeX
• Soumitra Dutta, Piero P. Bonissone:
  Integrating case-based and rule based reasoning: the possibilistic connection. 281-298
  Electronic Edition (link) BibTeX
• Ronald R. Yager:
  Credibility discounting in the theory of approximate reasoning. 299-310
  Electronic Edition (link) BibTeX
• Didier Dubois, Henri Prade:
  Updating with belief functions, ordinal conditional functions and possibility measures. 311-330
  Electronic Edition (link) BibTeX
• Hamid R. Berenji, Yung-Yaw Chen, Chuen-Chien Lee, Jyh-Shing Roger Jang, S. Murugesan:
  A hierarchical approach to designing approximate reasoning-based controllers for dynamic physical systems. 331-346
  Electronic Edition (link) BibTeX
• Ronald Fagin, Joseph Y. Halpern:
  A new approach to updating beliefs. 347-374
  Electronic Edition (link) BibTeX
• Philippe Smets:
  The transferable belief model and other interpretations of Dempster-Shafer's model. 375-384
  Electronic Edition (link) BibTeX
• Prakash P. Shenoy:
  Valuation-based systems for discrete optimisation. 385-400
  Electronic Edition (link) BibTeX
• Robert Kennes, Philippe Smets:
  Computational aspects of the Mobius transformation. 401-416
  Electronic Edition (link) BibTeX
• Alessandro Saffiotti:
  Using Dempster-Shafer theory in knowledge representation. 417-434
  Electronic Edition (link) BibTeX
• Kuo-Chu Chang, Robert M. Fung:
  Refinement and coarsening of Bayesian networks. 435-446
  Electronic Edition (link) BibTeX
• Gerhard Paass:
  Second order probabilities for uncertain and conflicting evidence. 447-456
  Electronic Edition (link) BibTeX
• Linda C. van der Gaag:
  Computing probability intervals under independency constraints. 457-466
  Electronic Edition (link) BibTeX
• Jack S. Breese, Kenneth W. Fertig:
  Decision making with interval influence diagrams. 467-480
  Electronic Edition (link) BibTeX
• Mary McLeish:
  A model for non-monotonic reasoning using Dempster's rule. 481-494
  Electronic Edition (link) BibTeX
• Philippe Smets, Yen-Teh Hsia:
  Default reasoning and the transferable belief model. 495-504
  Electronic Edition (link) BibTeX
• Peter Haddawy:
  Time, chance and action. 505-518
  Electronic Edition (link) BibTeX
• Finn Verner Jensen, Bo Chamberlain, Torsten Nordahl, Frank Jensen:
  Analysis in HUGIN of data conflict. 519-528
  Electronic Edition (link) BibTeX