Mixed deterministic and probabilistic networks

  • Authors:
  • Robert Mateescu;Rina Dechter

  • Affiliations:
  • Electrical Engineering Department, California Institute of Technology, Pasadena, USA 91125;Donald Bren School of Information and Computer Sciences, University of California Irvine, Irvine, USA 92697

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models. Several concepts and algorithms specific to belief networks and constraint networks are combined, achieving computational efficiency, semantic coherence and user-interface convenience. We define the semantics and graphical representation of mixed networks, and discuss the two main types of algorithms for processing them: inference-based and search-based. A preliminary experimental evaluation shows the benefits of the new model.