Graphical Representation of Defeasible Logic Rules Using Digraphs
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and conflicting information. Nevertheless, it is based on solid mathematical formulations and is not fully comprehensible by end users, who often need graphical trace and explanation mechanisms for the derived conclusions. Directed graphs (or digraphs) can assist in this affair, but their applicability is balanced by the fact that it is difficult to associate data of a variety of types with the nodes and the connections in the graph. In this paper we try to utilize digraphs in the graphical representation of defeasible rules, by exploiting their expressiveness, but also trying to counter their major disadvantage, by defining multiple node and connection types.
Unable to display preview. Download preview PDF.
- 1.Antoniou, G., van Harmelen, F.: A Semantic Web Primer. MIT Press, Cambridge (2004)Google Scholar
- 5.Diestel, R.: Graph Theory (Graduate Texts in Mathematics), 2nd edn. Springer, Heidelberg (2000)Google Scholar
- 6.Graphviz - Graph Visualization Software, http://www.graphviz.org
- 7.Jantzen, J.: Inference Planning Using Digraphs and Boolean Arrays. In: Proc. Int. Conf. on APL, pp. 200–204. ACM Press, New York (1989)Google Scholar
- 8.Nascimento, H.A.D.: A Framework for Human-Computer Interaction in Directed Graph Drawing. In: Proc. Australian Symp. on Information Visualization, pp. 63–69 (2001)Google Scholar