Combinable proof fragments for the web

From Semantic Portal Wiki

Edit

Reference:

1. Paulo Pinheiro da Silva, Deborah L. McGuinness, Richard Fikes. Combinable Proof Fragments for the Web , Knowledge Systems, AI Laboratory, Stanford University (KSL-03-04), 2003

bibtex

@techreport { KSL-03-04 ,
  author = "Paulo Pinheiro da Silva, Deborah L. McGuinness, Richard Fikes", 
institution = "Knowledge Systems, AI Laboratory, Stanford University", 
number = "KSL-03-04", 
title = "Combinable Proof Fragments for the Web", 
year = "2003", 
} 

abstract: Web applications must deal with a rapidly evolving, distributed, heterogeneous environment of information and reasoning services. Many applications obtain information from multiple sources and thus need to determine how, why, and when to use answers. Currently few if any web-based reasoning services make explanations available and, if they do, the supporting proofs of these explanations are rarely portable across applications. Thus, proofs, if available, are difficult to understand and more difficult to combine. This paper describes the properties of Inference Web (IW) portable proof fragments. These proof fragments can be combined and thus can be used to specify distributed proofs for web-based reasoning tasks. Moreover, the proof fragment can be used for merging proofs generated by distinct applications. We introduce the portable proof fragment specification used to enable Inference Web applications by example. Our examples are chosen from real world configuration-driven examples.

download:

• paper: KSL-03-04.pdf
• slides: