A Visualization Algorithm for Defeasible Logic Rule Bases over RDF Data

  • Efstratios Kontopoulos
  • Nick Bassiliades
  • Grigoris Antoniou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4524)

Abstract

This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produced that represents the rule base. The graph features distinct node types for rules and atomic formulas and distinct connection types for the various rule types of defeasible logic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bassiliades, N., Kontopoulos, E., Antoniou, G.: A Visual Environment for Developing Defeasible Rule Bases for the Semantic Web. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 172–186. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. Kontopoulos, E., Bassiliades, N., Antoniou, G.: Visualizing Defeasible Logic Rules for the Semantic Web. In: Mizoguchi, R., Shi, Z., Giunchiglia, F. (eds.) ASWC 2006. LNCS, vol. 4185, pp. 278–292. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. Nute, D.: Defeasible Reasoning. In: Proc. 20th Int. Conference on Systems Science, pp. 470–477. IEEE Press, New York (1987)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Efstratios Kontopoulos
    • 1
  • Nick Bassiliades
    • 1
  • Grigoris Antoniou
    • 2
  1. 1.Department of Informatics, Aristotle University of Thessaloniki, GR-54124 ThessalonikiGreece
  2. 2.Institute of Computer Science, FO.R.T.H., P.O. Box 1385, GR-71110, HeraklionGreece

Personalised recommendations