{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T08:23:31Z","timestamp":1787646211041,"version":"build-2736575974"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002395","name":"Saudi Pharmaceutical Society","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002395","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004415","name":"NATO","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004415","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jlamp.2026.101144","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:44:28Z","timestamp":1782852268000},"page":"101144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Fuzzy similarity and proximity constraint solving in theories with unordered symbols"],"prefix":"10.1016","volume":"151","author":[{"given":"Besik","family":"Dundua","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Demetre","family":"Labadze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tornike","family":"Tsereteli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jlamp.2026.101144_bib0001","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0304-3975(01)00188-8","article-title":"Approximate reasoning by similarity-based SLD resolution","volume":"275","author":"Sessa","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jlamp.2026.101144_bib0002","series-title":"30th IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2021","first-page":"1","article-title":"Proximity-based unification and matching for fully fuzzy signatures","author":"Pau","year":"2021"},{"key":"10.1016\/j.jlamp.2026.101144_bib0003","series-title":"Logic-Based Program Synthesis and Transformation - 29th International Symposium, LOPSTR 2019, Porto, Portugal, October 8\u201310, 2019, Revised Selected Papers","first-page":"107","article-title":"Solving proximity constraints","author":"Kutsia","year":"2019"},{"key":"10.1016\/j.jlamp.2026.101144_bib0004","series-title":"Efficient Reasoning in Equational Theories","author":"Duarte","year":"2023"},{"key":"10.1016\/j.jlamp.2026.101144_bib0005","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/j.jlamp.2026.101144_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2006-14101","article-title":"A survey of algebraic properties used in cryptographic protocols","volume":"14","author":"Cortier","year":"2006","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.jlamp.2026.101144_bib0007","series-title":"Prolog and Natural-Language Analysis","author":"Pereira","year":"2002"},{"key":"10.1016\/j.jlamp.2026.101144_bib0008","series-title":"International Joint Conference on Automated Reasoning","first-page":"529","article-title":"Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)","author":"Dur\u00e1n","year":"2022"},{"key":"10.1016\/j.jlamp.2026.101144_bib0009","series-title":"Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming","first-page":"1","article-title":"NuITP: an inductive theorem prover for equational program verification","author":"Dur\u00e1n","year":"2024"},{"key":"10.1016\/j.jlamp.2026.101144_bib0010","series-title":"Symbolic and Algebraic Computation, EUROSAM \u201979, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings","first-page":"22","article-title":"Unification of commutative terms","author":"Siekmann","year":"1979"},{"key":"10.1016\/j.jlamp.2026.101144_bib0011","series-title":"SPLT\u201983, S\u00e9minaire Programmation en Logique","article-title":"Note sur l\u2019unification des termes de premier ordre finis et infinis","author":"Fages","year":"1983"},{"key":"10.1016\/j.jlamp.2026.101144_bib0012","series-title":"M\u00e9thodes et outils de conception syst\u00e9matique d\u2019algorithmes d\u2019unification dans les th\u00e9ories \u00e9quationnelles","author":"Kirchner","year":"1985"},{"key":"10.1016\/j.jlamp.2026.101144_bib0013","series-title":"International Conference on Automated Deduction","first-page":"450","article-title":"Combination of unification algorithms","author":"Herold","year":"1986"},{"key":"10.1016\/j.jlamp.2026.101144_bib0014","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A unification algorithm for associative-commutative functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/j.jlamp.2026.101144_bib0015","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","article-title":"Complexity of unification problems with associative-commutative operators","volume":"9","author":"Kapur","year":"1992","journal-title":"J. Autom. Reason."},{"key":"10.1016\/j.jlamp.2026.101144_bib0016","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(98)00106-9","article-title":"On the complexity of boolean unification","volume":"67","author":"Baader","year":"1998","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jlamp.2026.101144_bib0017","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.ic.2014.07.008","article-title":"Efficient general agh-unification","volume":"238","author":"Liu","year":"2014","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jlamp.2026.101144_bib0018","series-title":"5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020","first-page":"30:1","article-title":"Constraint solving over multiple similarity relations","volume":"169","author":"Dundua","year":"2020"},{"key":"10.1016\/j.jlamp.2026.101144_bib0019","series-title":"Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3\u20136, 2024, Proceedings, Part II","first-page":"381","article-title":"Solving quantitative equations","author":"Ehling","year":"2024"},{"key":"10.1016\/j.jlamp.2026.101144_bib0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.fss.2019.03.019","article-title":"Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach","volume":"391","author":"A\u00eft-Kaci","year":"2020","journal-title":"Fuzzy Sets Syst."},{"key":"10.1016\/j.jlamp.2026.101144_bib0021","doi-asserted-by":"crossref","unstructured":"P. Juli\u00e1n-Iranzo, G. Moreno, J. Riaza, The fuzzy logic programming language FASILL: design and implementation 125 (2020) 139\u2013168.","DOI":"10.1016\/j.ijar.2020.06.002"},{"key":"10.1016\/j.jlamp.2026.101144_bib0022","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.fss.2014.07.006","article-title":"Proximity-based unification theory","volume":"262","author":"Juli\u00e1n-Iranzo","year":"2015","journal-title":"Fuzzy Sets Syst."},{"key":"10.1016\/j.jlamp.2026.101144_bib0023","series-title":"2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","first-page":"1","article-title":"An efficient proximity-based unification algorithm","author":"Juli\u00e1n-Iranzo","year":"2018"},{"key":"10.1016\/j.jlamp.2026.101144_bib0024","series-title":"Language, Logic, and Computation - 13th International Tbilisi Symposium, TbiLLC 2019, Batumi, Georgia, September 16\u201320, 2019, Revised Selected Papers","first-page":"323","article-title":"Matching and generalization modulo proximity and tolerance relations","author":"Kutsia","year":"2019"},{"key":"10.1016\/j.jlamp.2026.101144_bib0025","series-title":"IEEE International Conference on Fuzzy Systems, FUZZ 2025","first-page":"1","article-title":"Similarity-based constraint solving modulo commutativity: a unified framework","author":"Dundua","year":"2025"},{"key":"10.1016\/j.jlamp.2026.101144_bib0026","series-title":"2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","first-page":"1","article-title":"Towards a full fuzzy unification in the bousi prolog system","author":"Cornejo","year":"2018"},{"key":"10.1016\/j.jlamp.2026.101144_bib0027","doi-asserted-by":"crossref","unstructured":"B. Dundua, D. Labadze, T. Tsereteli, Fuzzy similarity and proximity constraint solving in commutative theories, 2025. https:\/\/www3.risc.jku.at\/projects\/stout\/software\/srcs-comm\/index.html.software.","DOI":"10.1016\/j.jlamp.2026.101144"},{"key":"10.1016\/j.jlamp.2026.101144_bib0028","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/767193.767195","article-title":"XDuce: a statically typed XML processing language","volume":"3","author":"Hosoya","year":"2003","journal-title":"ACM Trans. Internet Technol."},{"key":"10.1016\/j.jlamp.2026.101144_bib0029","series-title":"Web Reasoning and Rule Systems - Fourth International Conference, RR 2010, Bressanone\/Brixen, Italy, September 22\u201324, 2010. Proceedings","first-page":"164","article-title":"A rule-based approach to XML processing and web reasoning","author":"Coelho","year":"2010"},{"key":"10.1016\/j.jlamp.2026.101144_bib0030","series-title":"Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6\u201310, 2004, Proceedings","first-page":"450","article-title":"Xcerpt and XChange - logic programming languages for querying and evolution on the web","author":"Bry","year":"2004"},{"key":"10.1016\/j.jlamp.2026.101144_bib0031","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.is.2018.07.001","article-title":"An efficient similarity-based approach for comparing XML documents","volume":"78","author":"Oliveira","year":"2018","journal-title":"Inf. Syst."},{"key":"10.1016\/j.jlamp.2026.101144_bib0032","unstructured":"I. Boneva, R. Ciucanu, S. Staworko, Simple schemas for unordered XML, (2013). arXiv preprint arXiv: 1303.4277."},{"key":"10.1016\/j.jlamp.2026.101144_bib0033","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00224-014-9593-1","article-title":"Schemas for unordered XML on a DIME","volume":"57","author":"Boneva","year":"2015","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jlamp.2026.101144_bib0034","series-title":"20th International Conference on Database Theory","first-page":"1","article-title":"Compression of unordered XML trees","author":"Lohrey","year":"2017"},{"key":"10.1016\/j.jlamp.2026.101144_bib0035","series-title":"Proceedings of the 15th International Conference on Database Theory","first-page":"46","article-title":"Highly expressive query languages for unordered data trees","author":"Abiteboul","year":"2012"},{"key":"10.1016\/j.jlamp.2026.101144_bib0036","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1089\/cmb.2006.13.182","article-title":"Pairwise alignment of protein interaction networks","volume":"13","author":"Koyut\u00fcrk","year":"2006","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.jlamp.2026.101144_bib0037","doi-asserted-by":"crossref","DOI":"10.1002\/minf.202400361","article-title":"Simple user-friendly reaction format","volume":"44","author":"Nippa","year":"2025","journal-title":"Mol. Inform."},{"key":"10.1016\/j.jlamp.2026.101144_bib0038","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","article-title":"Complexity of matching problems","volume":"3","author":"Benanav","year":"1987","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jlamp.2026.101144_bib0039","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1093\/comjnl\/38.5.381","article-title":"Associative-commutative matching via bipartite graph matching","volume":"38","author":"Eker","year":"1995","journal-title":"Comput. J."},{"key":"10.1016\/j.jlamp.2026.101144_bib0040","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: a survey","volume":"19\/20","author":"Jaffar","year":"1994","journal-title":"J. Log. Program."}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000362?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220826000362?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T07:27:05Z","timestamp":1787642825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220826000362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":40,"alternative-id":["S2352220826000362"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101144","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fuzzy similarity and proximity constraint solving in theories with unordered symbols","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2026.101144","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"101144"}}