Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ł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)
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)
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)
Słowiński, R., Greco, S.: A note on dependency factor (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawlak, Z. (2004). Decision Networks. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive