ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Data & Knowledge Engineering
Volume 64, Issue 3, March 2008, Pages 662-687
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1995 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.datak.2007.10.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Proof explanation for a nonmonotonic Semantic Web rules language

Grigoris Antonioua, Corresponding Author Contact Information, E-mail The Corresponding Author, Antonis Bikakisa, Nikos Dimaresisa, Manolis Genetzakisa, Giannis Georgalisa, Guido Governatorib, Efie Karouzakia, Nikolas Kazepisa, Dimitris Kosmadakisa, Manolis Kritsotakisa, Giannis Lilisa, Antonis Papadogiannakisa, Panagiotis Pediaditisa, Constantinos Terzakisa, Rena Theodosakia and Dimitris Zeginisa

aInstitute of Computer Science, FO.R.T.H., Vassilika Vouton, P.O. Box 1385, GR 71110 Heraklion, Greece bSchool of ITEE, The University of Queensland, Australia

Accepted 17 October 2007. 
Available online 1 November 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic Web. If users (humans and agents) are to use and integrate system answers, they must trust them. Thus, systems should be able to explain their actions, sources, and beliefs. Our system produces automatically proof explanations using a popular logic programming system (XSB), by interpreting the output from the proof’s trace and converting it into a meaningful representation. It also supports an XML representation for agent communication, which is a common scenario in the Semantic Web. In this paper, we present the design and implementation of the system, a RuleML language extension for the representation of a proof explanation, and we give some examples of the system. The system in essence implements a proof layer for nonmonotonic rules on the Semantic Web.

Keywords: Defeasible reasoning; Nonmonotonic rule systems; Semantic Web proof layer; Proof explanation; RuleML

Article Outline

1. Introduction
2. Use cases
3. Basics of Defeasible Logic
3.1. Basic characteristics
3.2. Syntax
3.3. Proof theory
3.4. Defeasible Logic metaprogram
4. Explanation in Defeasible Logic
4.1. Search tree construction
4.2. Search tree pruning: illustration
4.3. Search tree pruning: the methods
5. Graphical user interface to the proof system
6. Agent interface to the proof system
7. Extension of RuleML for explanation representation
7.1. Atoms, facts and rule representation
7.2. Definitely provable explanations
7.3. Defeasibly provable explanations
7.4. Not definitely provable explanations
7.5. Not defeasibly provable explanations
8. Related work
8.1. Inference web
9. Conclusion and future work
Acknowledgements
References
Vitae









 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.