]> 2012-02-10T14:36:11-05:00 Towards checking hybrid proofs The distributed and heterogeneous nature of today's applications such as the Web implies that a variety of agents may participate in answering questions. Since multiple agents with various reasoning methods and representation languages are possible, inference rules used to derive any particular answer may be quite diverse. In this paper we introduce the Inference Meta Language to represent inference rules in an abstract and uniform way. The language may be used to annotate proofs enabling them to be automatically checked. Checking may be critical if systems combine answers, i.e., web service composition. We have implemented a parser and checker for the language and it is in use in several proof-based explanation solutions. techreport KSL-05-01 KSL-05-01 Towards Checking Hybrid Proofs KSL-05-01 2005 Year Tr id Title Computer science Tag Media:KSL-05-01.pdf Paper Number Key Knowledge Systems, AI Laboratory, Stanford University Institution Bibtype Priyendra Deshwal Richard Fikes Deborah L. McGuinness Patrick J. Hayes Paulo Pinheiro da Silva Author Abstract KSL Technical Report Publication Technical Report