Towards Checking Hybrid Proofs

Reference: Pinheiro da Silva, P.; Hayes, P.; McGuinness, D. L.; Fikes, R.; & Deshwal, P. Towards Checking Hybrid Proofs. Technical Report, Knowledge Systems, AI Laboratory, Stanford University., 2005.

Abstract: 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.

Full paper available as pdf.

Jump to... [KSL] [SMI] [Reports by Author] [Reports by KSL Number] [Reports by Year]
Send mail to: ksl-info@ksl.stanford.edu to send a message to the maintainer of the KSL Reports.