We present a framework for representing the probabilistic effects of actions and contingent treatment plans. Our language has a well-defined declarative semantics and we have developed an implemented algorithm (named BNG) that generates Bayesian networks (BN) to compute the posterior probabilities of queries. In this paper we address the problem of projecting a contingent treatment plan by automatically constructing a structure of interrelated BNs, which we call a BN-graph, and applying the available propagation procedures on it. To address the optimal plan generation, we base our approach on the observation that normally the target plan space has a well-defined structure. We provide a language to describe plan spaces which resembles a programming language with loops and conditionals. We briefly present the procedures for finding the optimal plan(s) from such specified plan spaces.
展开▼
