info@viam.science.tsu.ge (+995 32) 2 30 30 40 (+995 32) 2 18 66 45

Tolerance-Based Techniques for Approximate Reasoning (FR-21-16725)


Funded by

SRNSFGShota Rustaveli National Science Foundation of Georgia

Start Date: 2022-03-14       End Date: 2025-03-14

Reasoning with incomplete, imperfect information is very common in human communication. Its modeling is a highly nontrivial task and remains an important issue in applications of artificial intelligence.
For many problems in this area, exact equality/equivalence is replaced by its approximation. Tolerance relations are a tool to express it, modeling the corresponding imprecise information. They are reflexive and symmetric but not necessarily transitive relations, expressing the idea of closeness or resemblance. The original idea goes back to Poincaré, who viewed tolerance as the notion of fundamental importance in distinguishing mathematics applied to the physical world from ideal mathematics.
In the original version, tolerance relations were crisp (e.g., two objects are either close to each other or not). Later, their graded counterparts appeared which led, among others, to tolerance relations in the fuzzy setting. Fuzzy tolerance is often called proximity, and its special case, fuzzy equivalence, is called similarity. The project concentrates on techniques to advance automated or semi-automated reasoning for these relations.
The techniques we plan to develop concern three major activities in mathematical reasoning: solving, computing, and proving. We develop solving algorithms (modulo proximity/similarity relations) for optimal unification problems and for constraints over fuzzy or crisp sets. These algorithms and some of the existing ones will be used to advance constrained rewriting and simplification techniques (the computing part) as well as approximate theorem proving techniques for selected fragments of logic over proximity/similarity relations (the proving part). Finally, we aim at combining computation and deduction in a single framework as it is done, e.g., in Rewriting Logic or ρLog, extending the power of such formalisms from exact to approximate setting modulo proximity and similarity.

Project members:

Talks

  • Approximate Reasoning Techniques, by Mikheil Rukhaia (Speaker) at XXXVI International Enlarged Sessions of the Seminar of Ilia Vekua Institute of Applied Mathematics, 2022, Tbilisi, Georgia.
  • Towards Similarity-based Set Unification, by Mikheil Rukhaia (Speaker), Temur Kutsia at XII Annual International Conference of Georgian Mathematical Union, 2022, Batumi, Georgia.
  • Tolerance-Based Techniques for Approximate Reasoning, by Mikheil Rukhaia (Speaker), Temur Kutsia, Mircea Marin at 19th International Conference Computability in Europe, 2023, Batumi, Georgia.
  • Similarity-based Set Matching, by Mikheil Rukhaia (Speaker), Temur Kutsia, Mircea Marin at XIII Annual International Conference of Georgian Mathematical Union, 2023, Batumi, Georgia.

Publications

  • Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia, Enumerating All Maximal Clique-Partitions of an Undirected Graph, H. Cheval, L. Leus¸tean, A. Sipos¸ (Eds.): 7th Symposium on Working Formal Methods (FROM 2023), EPTCS 389, 2023, pp. 65–79, Open Publishing Association, 2023.

Additional Information

Project first reporting period technical report.
Project second reporting period technical report.