Table of Contents

• An Algorithm for Finding Minimum d-Separating Sets in Belief NetworksSilvia Acid, Luis M. de Campos. 3-10 [doi]
• Constraining Influence Diagram Structure by Generative Planning: An Application to the Optimization of Oil Spill ResponseJohn Mark Agosta. 11-19 [doi]
• Inference Using Message Propagation and Topology Transformation in Vector Gaussian Continuous NetworksSatnam Alag, Alice M. Agogino. 20-27 [doi]
• A Structurally and Temporally Extended Bayesian Belief Network Model: Definitions, Properties, and Modeling TechniquesConstantin F. Aliferis, Gregory F. Cooper. 28-39 [doi]
• An Alternative Markov Property for Chain GraphsSteen A. Andersson, David Madigan, Michael D. Perlman. 40-48 [doi]
• Plan Development using Local Probabilistic ModelsElla M. Atkins, Edmund H. Durfee, Kang G. Shin. 49-56 [doi]
• Entailment in Probability of Thresholded GeneralizationsDonald Bamber. 57-64 [doi]
• Object Recognition with Imperfect Perception and Redundant DescriptionClaude Barrouil, Jerome Lemaire. 65-72 [doi]
• Approximations for Decision Making in the Dempster-Shafer Theory of EvidenceMathias Bauer. 73-80 [doi]
• A sufficiently fast algorithm for finding close to optimal junction treesAnn Becker, Dan Geiger. 81-89 [doi]
• Coping with the Limitations of Rational Inference in the Framework of Possibility TheorySalem Benferhat, Didier Dubois, Henri Prade. 90-97 [doi]
• Arguing for Decisions: A Qualitative Model of Decision MakingBlai Bonet, Hector Geffner. 98-105 [doi]
• Learning Conventions in Multiagent Stochastic Domains using Likelihood EstimatesCraig Boutilier. 106-114 [doi]
• Context-Specific Independence in Bayesian NetworksCraig Boutilier, Nir Friedman, Moisés Goldszmidt, Daphne Koller. 115-123 [doi]
• Decision-Theoretic Troubleshooting: A Framework for Repair and ExperimentJohn S. Breese, David Heckerman. 124-132 [doi]
• Tail Sensitivity Analysis in Bayesian NetworksEnrique Castillo, Cristina Solares, Patricia Gómez. 133-140 [doi]
• Decision-Analytic Approaches to Operational Decision Making: Application and ObservationTom Chávez. 141-149 [doi]
• Learning Equivalence Classes of Bayesian Network StructuresDavid Maxwell Chickering. 150-157 [doi]
• Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian NetworkDavid Maxwell Chickering, David Heckerman. 158-168 [doi]
• Independence with Lower and Upper ProbabilitiesLonnie Chrisman. 169-177 [doi]
• Propagation of 2-Monotone Lower Probabilities on an Undirected GraphLonnie Chrisman. 178-185 [doi]
• Quasi-Bayesian Strategies for Efficient Plan Generation: Application to the Planning to Observe ProblemFabio Gagliardi Cozman, Eric Krotkov. 186-193 [doi]
• Some Experiments with Real-time Decision AlgorithmsBruce D Ambrosio, Scott Burgess. 194-202 [doi]
• Query DAGs: A practical paradigm for implementing belief-network inferenceAdnan Darwiche, Gregory M. Provan. 203-210 [doi]
• Bucket elimination: A unifying framework for probabilistic inferenceRina Dechter. 211-219 [doi]
• Topological parameters for time-space tradeoffRina Dechter. 220-227 [doi]
• Sound Abstraction of Probabilistic Actions in The Constraint Mass Assignment FrameworkAnHai Doan, Peter Haddawy. 228-235 [doi]
• Belief Revision with Uncertain Inputs in the Possibilistic SettingDidier Dubois, Henri Prade. 236-243 [doi]
• An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuitsYousri El Fattah, Rina Dechter. 244-251 [doi]
• Learning Bayesian Networks with Local StructureNir Friedman, Moisés Goldszmidt. 252-262 [doi]
• A Qualitative Markov Assumption and Its Implications for Belief ChangeNir Friedman, Joseph Y. Halpern. 263-273 [doi]
• On the Sample Complexity of Learning Bayesian NetworksNir Friedman, Zohar Yakhini. 274-282 [doi]
• Asymptotic Model Selection for Directed Networks with Hidden VariablesDan Geiger, David Heckerman, Christopher Meek. 283-290 [doi]
• Theoretical Foundations for Abstraction-Based Probabilistic PlanningVu A. Ha, Peter Haddawy. 291-298 [doi]
• Defining Relative Likelihood in Partially-Ordered Preferential StructuresJoseph Y. Halpern. 299-306 [doi]
• Why is diagnosis using belief networks insensitive to imprecision in probabilities?Max Henrion, Malcolm Pradhan, Brendan Del Favero, Kurt Huang, Gregory M. Provan, Paul O Rorke. 307-314 [doi]
• Flexible Policy Construction by Information RefinementMichael C. Horsch, David Poole. 315-324 [doi]
• Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilonKurt Huang, Max Henrion. 325-331 [doi]
• A Probabilistic Model for Sensor ValidationPablo H. Ibargüengoytia, Luis Enrique Sucar, Sunil Vadera. 332-339 [doi]
• Computing upper and lower bounds on likelihoods in intractable networksTommi Jaakkola, Michael I. Jordan. 340-348 [doi]
• MIDAS: An Influence Diagram for Management of Mildew in Winter WheatAllan Leck Jensen, Finn Verner Jensen. 349-356 [doi]
• Computational complexity reduction for BN2O networks using similarity of statesAlexander V. Kozlov, Jaswinder Pal Singh. 357-364 [doi]
• Uncertain Inferences and Uncertain ConclusionsHenry E. Kyburg Jr.. 365-372 [doi]
• Bayesian Learning of Loglinear Models for Neural ConnectivityKathryn B. Laskey, Laura Martignon. 373-380 [doi]
• Generalized Qualitative Probability: Savage revisitedDaniel J. Lehmann. 381-388 [doi]
• Network Engineering for Complex Belief NetworksSuzanne M. Mahoney, Kathryn B. Laskey. 389-396 [doi]
• Probabilistic Disjunctive Logic ProgrammingLiem Ngo. 397-404 [doi]
• Toward a Market Model for Bayesian InferenceDavid M. Pennock, Michael P. Wellman. 405-413 [doi]
• Geometric Implications of the Naive Bayes AssumptionMark A. Peot. 414-419 [doi]
• Identifying Independencies in Causal Graphs with FeedbackJudea Pearl, Rina Dechter. 420-426 [doi]
• A Graph-Theoretic Analysis of Information ValueKim-Leng Poh, Eric Horvitz. 427-435 [doi]
• A Framework for Decision-Theoretic Planning I: Combining the Situation Calculus, Conditional Plans, Probability and UtilityDavid Poole. 436-445 [doi]
• Optimal Monte Carlo Estimation of Belief Network InferenceMalcolm Pradhan, Paul Dagum. 446-453 [doi]
• A Discovery Algorithm for Directed Cyclic GraphsThomas Richardson. 454-461 [doi]
• A Polynomial-Time Algorithm for Deciding Equivalence of Directed Cyclic Graphical ModelsThomas Richardson. 462-469 [doi]
• Coherent Knowledge Processing at Maximum Entropy by SPIRITWilhelm Rödder, Carl-Heinz Meyer. 470-476 [doi]
• Sample-and-Accumulate Algorithms for Belief Updating in Bayes NetworksEugene Santos Jr., Solomon Eyal Shimony, Edward Michael Williams. 477-484 [doi]
• A Measure of Decision FlexibilityRoss D. Shachter, Marvin Mandelbaum. 485-491 [doi]
• Binary Join TreesPrakash P. Shenoy. 492-499 [doi]
• Efficient enumeration of instantiations in Bayesian networksSampath Srinivas, P. Pandurang Nayak. 500-508 [doi]
• On Separation Criterion and Recovery Algorithm for Chain GraphsMilan Studený. 509-516 [doi]
• Possible World Partition Sequences: A Unifying Framework for Uncertain ReasoningChoh-Man Teng. 517-524 [doi]
• Supply Restoration in Power Distribution Systems: A Case Study in Integrating Model-Based Diagnosis and Repair PlanningSylvie Thiébaux, Marie-Odile Cordier, Olivier Jehl, Jean-Paul Krivine. 525-532 [doi]
• Real Time Estimation of Bayesian NetworksRobert L. Welch. 533-544 [doi]
• Testing Implication of Probabilistic DependenciesS. K. Michael Wong. 545-553 [doi]
• Optimal Factory Scheduling using Stochastic Dominance A*Peter R. Wurman, Michael P. Wellman. 554-563 [doi]
• Critical Remarks on Single Link Search in Learning Belief NetworksYang Xiang, S. K. Michael Wong, Nick Cercone. 564-571 [doi]