A connection between Similarity Logic Programming and Godel Modal Logic
Luciano Blandi, Lluı́s Godo, Ricardo O. Rodr ́ iguez · 2005
In this paper we relate two logical similarity-based approaches to approximate reasoning. One ap-proach extends the framework of (propositional) classical logic programming by introducing a simi-larity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a many-valued modal logic ap-proach where!p is understood as approximately p. Here, the similarity relations are introduced at the level of the Kripke models where possible worlds can be similar to some extent. We show that the former approach can be expressed inside the latter.