Jesús M. Almendros-Jiménez , Antonio Becerra-Terón , Ginés Moreno , José A. Riaza
{"title":"Tuning fuzzy SPARQL queries","authors":"Jesús M. Almendros-Jiménez , Antonio Becerra-Terón , Ginés Moreno , José A. Riaza","doi":"10.1016/j.ijar.2024.109209","DOIUrl":null,"url":null,"abstract":"<div><p>During the last years, the study of fuzzy database query languages has attracted the attention of many researchers. In this line of research, our group has proposed and developed <span>FSA-SPARQL</span> (<em>Fuzzy Sets and Aggregators based SPARQL</em>), which is a fuzzy extension of the Semantic Web query language SPARQL. <span>FSA-SPARQL</span> works with fuzzy RDF datasets and allows the definition of fuzzy queries involving fuzzy conditions through fuzzy connectives and aggregators. However, there are two main challenges to be solved for the practical applicability of <span>FSA-SPARQL</span>. The first problem is the lack of fuzzy RDF data sources. The second is how to customize fuzzy queries on fuzzy RDF data sources. Our research group has also recently proposed a fuzzy logic programming language called <span><math><mi>F</mi><mi>A</mi><mi>S</mi><mi>I</mi><mi>L</mi><mi>L</mi></math></span> that offers powerful tuning capabilities that can accept applications in many fields. The purpose of this paper is to show how the <span><math><mi>F</mi><mi>A</mi><mi>S</mi><mi>I</mi><mi>L</mi><mi>L</mi></math></span> tuning capabilities serve to accomplish in a unified framework both challenges in <span>FSA-SPARQL</span>: data fuzzification and query customization. More concretely, from a <span>FSA-SPARQL</span> to <span><math><mi>F</mi><mi>A</mi><mi>S</mi><mi>I</mi><mi>L</mi><mi>L</mi></math></span> transformation, data fuzzification and query customization in <span>FSA-SPARQL</span> become <span><math><mi>F</mi><mi>A</mi><mi>S</mi><mi>I</mi><mi>L</mi><mi>L</mi></math></span> tuning problems. We have validated the approach with queries against datasets from online communities.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"170 ","pages":"Article 109209"},"PeriodicalIF":3.2000,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24000963/pdfft?md5=d1a2bfe1bba5c82a286b84ddb02fef74&pid=1-s2.0-S0888613X24000963-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X24000963","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
During the last years, the study of fuzzy database query languages has attracted the attention of many researchers. In this line of research, our group has proposed and developed FSA-SPARQL (Fuzzy Sets and Aggregators based SPARQL), which is a fuzzy extension of the Semantic Web query language SPARQL. FSA-SPARQL works with fuzzy RDF datasets and allows the definition of fuzzy queries involving fuzzy conditions through fuzzy connectives and aggregators. However, there are two main challenges to be solved for the practical applicability of FSA-SPARQL. The first problem is the lack of fuzzy RDF data sources. The second is how to customize fuzzy queries on fuzzy RDF data sources. Our research group has also recently proposed a fuzzy logic programming language called that offers powerful tuning capabilities that can accept applications in many fields. The purpose of this paper is to show how the tuning capabilities serve to accomplish in a unified framework both challenges in FSA-SPARQL: data fuzzification and query customization. More concretely, from a FSA-SPARQL to transformation, data fuzzification and query customization in FSA-SPARQL become tuning problems. We have validated the approach with queries against datasets from online communities.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.