Similarity-based SLD resolution and its implementation in an extended Prolog system

This paper presents an extension of SLD resolution towards approximate reasoning. The proposed refutation procedure overcomes failures in the unification process by exploiting similarity relation 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.

[1]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[2]  Henri Prade,et al.  A logical approach to interpolation based on similarity relations , 1997, Int. J. Approx. Reason..

[3]  Enrique H. Ruspini,et al.  On the semantics of fuzzy logic , 1991, Int. J. Approx. Reason..

[4]  Liya Ding,et al.  Fundamentals of Fuzzy Prolog , 1989, Int. J. Approx. Reason..

[5]  Maria I. Sessa,et al.  Approximate reasoning by similarity-based SLD resolution , 2002, Theor. Comput. Sci..

[6]  Frank Klawonn,et al.  Lukasiewicz logic based Prolog , 1994 .

[7]  Giangiacomo Gerla,et al.  Similarity-based Unification , 2000, Fundam. Informaticae.

[8]  Richard C. T. Lee.  Fuzzy Logic and the Resolution Principle , 1971, JACM.

[9]  Vincenzo Loia,et al.  A similarity-based view to distributed information retrieval with mobile agents , 2001, 10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297).

[10]  Giangiacomo Gerla,et al.  Similarity in Logic Programming , 1999 .