A decision network is a finite, directed acyclic graph, nodes of which represent logical formulas, whereas branches – are interpreted as decision rules. Every path in the graph represents a chain of decision rules, which describe compound decision.

Some properties of decision networks will be given and a simple example will illustrate the presented ideas and show possible applications.


decision rules decision algorithms decision networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Łukasiewicz, J.: Die logishen Grundlagen der Wahrscheinilchkeitsrechnung. Kraków (1913); In: Borkowski, L. (ed.): Jan Łukasiewicz – Selected Works, pp. 16–63. North Holland Publishing Company, Polish Scientific Publishers, Amsterdam, London, Warsaw (1970)Google Scholar
  2. 2.
    Pawlak, Z.: Probability, Truth and Flow Graphs. In: Skowron, A., Szczuka, M. (eds.) RSKD – International Workshop and Soft Computing, ETAPS 2003, Warsaw, pp. 1–9 (2003)Google Scholar
  3. 3.
    Pawlak, Z.: Flow graphs and decision algorithms. In: Wang, G., Liu, Q., Yao, Y.Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 1–11. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Słowiński, R., Greco, S.: A note on dependency factor (manuscript)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zdzisław Pawlak
    • 1
    • 2
  1. 1.Institute for Theoretical and Applied InformaticsPolish Academy of SciencesGliwicePoland
  2. 2.Warsaw School of Information TechnologyWarsawPoland

Personalised recommendations