This paper introduces a similarity-based constraint-solving algorithm modulo commutativity, extending classical methods to accommodate fuzzy relations and approximate reasoning. We present a framework capable of solving equations even with function symbol mismatches. We prove the soundness, completeness, and termination of the proposed algorithm. The algorithm is implemented via a web-based interface, improving accessibility and usability.
Similarity-Based Constraint Solving Modulo Commutativity: A Unified Framework
B. Dundua,Demetre Labadze,Tornike Tsereteli
Published 2025 in IEEE International Conference on Fuzzy Systems
ABSTRACT
PUBLICATION RECORD
- Publication year
2025
- Venue
IEEE International Conference on Fuzzy Systems
- Publication date
2025-07-06
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-16 of 16 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1