Similarity-based SLD resolution and its role for web knowledge discovery

This work presents the implementation of an extension of SLD resolution towards approximate reasoning and its implementation in an extended Prolog system. The proposed refutation procedure overcomes failures in the unification process by exploiting similarity relations defined between predicate and constant symbols. This enables to compute approximate solutions, with an associated approximation degree, when failures of the exact inference process occur. In this paper we outline the main ideas of this approach and we present an extended PROLOG interpreter, named SiLog, which implements this inference procedure. Then we point out on a web-based platform, usable for knowledge discovery, that exploits as inner feature the similarity-based SLD resolution.