Skip to main content

Graphical Representation of Defeasible Logic Rules Using Digraphs

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 3955)

Abstract

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11752912_61
  • Chapter length: 5 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-34118-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   149.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoniou, G., van Harmelen, F.: A Semantic Web Primer. MIT Press, Cambridge (2004)

    Google Scholar 

  2. Antoniou, G.: Nonmonotonic Reasoning. MIT Press, Cambridge (1997)

    MATH  Google Scholar 

  3. Chakravarthy, S., Zhang, H.: Visualization of association rules over relational DBMSs. In: Proc. 2003 ACM Symp. on Applied Computing, pp. 922–926. ACM Press, New York (2003)

    CrossRef  Google Scholar 

  4. Clarke, D.: An Augmented Directed Graph Base for Application Development. In: Proc. 20th annual Southeast regional Conf., pp. 155–159. ACM Press, New York (1982)

    CrossRef  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kontopoulos, E., Bassiliades, N. (2006). Graphical Representation of Defeasible Logic Rules Using Digraphs. In: Antoniou, G., Potamias, G., Spyropoulos, C., Plexousakis, D. (eds) Advances in Artificial Intelligence. SETN 2006. Lecture Notes in Computer Science(), vol 3955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752912_61

Download citation

  • DOI: https://doi.org/10.1007/11752912_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34117-8

  • Online ISBN: 978-3-540-34118-5

  • eBook Packages: Computer ScienceComputer Science (R0)