LPIS Home Page
Google Search

Title: Visualizing Defeasible Logic Rules for the Semantic Web
Author(s): E. Kontopoulos, N. Bassiliades, G. Antoniou.
Availability: Click here to download the PDF (Acrobat Reader) file (14 pages).
Keywords: visualization, defeasible logic, RDF, stratification.
Appeared in: 1st Asian Semantic Web Conference (ASWC'06), Springer-Verlag, LNCS 4185, pp. 278-292, Beijing, China, 3-7 September, 2006.
Abstract: Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and conflicting information. Such reasoning is useful in many Semantic Web applications, like policies, business rules, brokering, bargaining and agent negotiations. Nevertheless, defeasible logic is based on solid mathe-matical formulations and is, thus, not fully comprehensible by end users, who often need graphical trace and explanation mechanisms for the derived conclu-sions. Directed graphs can assist in confronting this drawback. They are a pow-erful and flexible tool of information visualization, offering a convenient and comprehensible way of representing relationships between entities. Their appli-cability, however, is balanced by the fact that it is difficult to associate data of a variety of types with the nodes and the arcs in the graph. In this paper we try to utilize digraphs in the graphical representation of defeasible rules, by exploiting the expressiveness and comprehensibility they offer, but also trying to leverage their major disadvantage, by defining two distinct node types, for rules and atomic formulas, and four distinct connection types for each rule type in defea-sible logic and for superiority relationships. The paper also briefly presents a tool that implements this representation methodology.

        This paper has been cited by the following:

1 Goedertier, S., Mues, C., Vanthienen, J. "Specifying Process-Aware Access Control Rules in SBVR". In Paschke, A., Biletskiy, Y. (Eds.), Advances in Rule Interchange and Applications, Proc. Int. RuleML Symposium (RuleML 2007), Lecture Notes in Computer Science (Springer), volume 4824, pp. 39-52, 2007.
2 Goedertier, S. "Declarative Techniques for Modeling and Mining Business Processes". PhD Thesis, Katholieke Universiteit Leuven, Belgium, 2008.
3 Rubino, R. "An Implementation of Temporal Defeasible Logic for Legal Reasoning". PhD Thesis, Centro Interdipartimentale di Ricerca in Storia del Diritto, Filosofia e Sociologia del Diritto e Informatica Giuridica, University of Bolognia, 2009.
4 Hassanpour, S., O'Connor, M. J., Das, A. K. "Visualizing Logical Dependencies in SWRL Rule Bases". Proc. Int. RuleML Symposium on Rule Interchange and Applications, Springer-Verlag, pp. 259-272, Washington, DC, 2010.