Graphical Representation of Defeasible Logic Rules using Digraphs

E. Kontopoulos, N. Bassiliades, “Graphical Representation of Defeasible Logic Rules using Digraphs”, Proc. 4th Hellenic Conference on Artificial Intelligence (SETN-06), G. Antoniou, G. Potamias, D. Plexousakis, C. Spyropoulos (Ed.), Springer-Verlag, LNAI 3955, pp. 529-533, Heraklion, Crete, 18-20 May, 2006.

Proc. 4th Hellenic Conference on Artificial Intelligence (SETN-06), G. Antoniou, G. Potamias, D. Plexousakis, C. Spyropoulos (Ed.), Springer-Verlag, LNAI 3955, pp. 529-533, Heraklion, Crete, 18-20 May, 2006.

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 conclu-sions. Directed graphs (or digraphs) can assist in this affair, but their applicabil-ity 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 de-fining multiple node and connection types.