Abstract
Logic and proofs constitute key factors in increasing the user trust towards the Semantic Web. Defeasible reasoning is a useful tool towards the development of the Logic layer of the Semantic Web architecture. However, having a solid mathematical notation, it may be confusing to end users, who often need graphical trace and explanation mechanisms for the derived conclusions. In a previous work of ours, we outlined a methodology for representing defeasible logic rules, utilizing directed graphs that feature distinct node and connection types. However, visualizing a defeasible logic rule base also involves the placement of the multiple graph elements in an intuitive way, a non-trivial task that aims at improving user comprehensibility. This paper presents a stratification algorithm for visualizing defeasible logic rule bases that query and reason about RDF data as well as a tool that applies this algorithm.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-124

BibTeX:

@inproceedings{REWERSE-RP-2007-124,
	author = {Efstratios Kontopoulos and Nick Bassiliades and Grigoris Antoniou},
	title = {Visual Stratification of Defeasible Logic Rule Bases},
	booktitle = {Proceedings of 19th IEEE International Conference on Tools with Artificial Intelligence, Patras, Greece (29th--31st October 2007)},
	year = {2007},
	volume = {2},
	organization = {IEEE},
	pages = {238--245},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-124}
}