Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language

Similarity-Based Reasoning With Order-Sorted Feature Logic

“…Another possible application of our approach is the implementation of a logic programming language based on SLD resolution and OSF term unification (like LOGIN [26]), which additionally allows the specification of a sort similarity relation, similarly to how Bousi∼Prolog [13], [14] allows the specification of a similarity (or proximity) relation between functors, constants and predicates 8 . The addition of a similarity relation allows the retrieval of approximate solutions to a query, improving the flexibility of query answering.…”

“…Consider the logic program enriched with a similarity relation of Fig. 10a, which follows the syntax of Bousi∼Prolog [13], [14]. The program starts by describing the similarity and the subsumption relations of Fig.…”

“…systems such as FASILL [12] and Bousi∼Prolog [13], [14], which has been employed in several applications such as text classification [15], [16], linguistic feedback in computer games [17], decision making [18], [19], and knowledge discovery [20]. Aït-Kaci and Pasi [21] have presented a procedure for weak unification that, besides tolerating different (but similar) functor symbols, also allows the unification of FOTs with a different number and possibly a different order of arguments.…”

“…Note that Bousi∼Prolog also supports proximity relations[13],[14] (i.e., reflexive and symmetric fuzzy binary relations, which can be more appropriate in some modeling contexts[7],[45],[46]), and linguistic variables[47].…”