Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies

Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies

Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Borgwardt, Stefan, Mailis, Theofilos, Peñaloza, Rafael, Turhan, Anni-Yasmin
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Artificial Intelligence
Computer Science - Logic in Computer Science
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Borgwardt, Stefan
Mailis, Theofilos
Peñaloza, Rafael
Turhan, Anni-Yasmin
description Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known technique that reduces the fuzzy ontology to a classical one, and use classical DL reasoners as a black box. We improve the complexity of previous reduction techniques for finitely valued fuzzy DLs, which allows us to prove tight complexity results for answering certain kinds of fuzzy CQs. We conclude with an experimental evaluation of a prototype implementation, showing the feasibility of our approach.
doi_str_mv 10.48550/arxiv.1508.02626
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1508_02626</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1508_02626</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-5154723e540d1b3135e86c783e5858d2ac572d9826a5101cf1fe5d5fd30da4cd3</originalsourceid><addsrcrecordid>eNotj8tqwzAURLXJoiT9gK6qH7Crh6-sLIOp20AgFEK3RpWug4IjB_nROl9fN81qYOYwcAh54izNNAB7MfHHjykHplMmlFAPZLsJ3TdGH460HK7XiRZtOA3B9n5E-jHMC3a0HTHS0gffYzPRT9MM6O74PvRt0x5nakUWtWk6fLznkhzK10Pxnuz2b9tis0uMylUCHLJcSISMOf4luQTUyuZ6bjRoJ4yFXLi1FsoAZ9zWvEZwUDvJnMmsk0vy_H97c6ku0Z9NnKo_p-rmJH8BNABHVA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies</title><source>arXiv.org</source><creator>Borgwardt, Stefan ; Mailis, Theofilos ; Peñaloza, Rafael ; Turhan, Anni-Yasmin</creator><creatorcontrib>Borgwardt, Stefan ; Mailis, Theofilos ; Peñaloza, Rafael ; Turhan, Anni-Yasmin</creatorcontrib><description>Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known technique that reduces the fuzzy ontology to a classical one, and use classical DL reasoners as a black box. We improve the complexity of previous reduction techniques for finitely valued fuzzy DLs, which allows us to prove tight complexity results for answering certain kinds of fuzzy CQs. We conclude with an experimental evaluation of a prototype implementation, showing the feasibility of our approach.</description><identifier>DOI: 10.48550/arxiv.1508.02626</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Logic in Computer Science</subject><creationdate>2015-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1508.02626$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1508.02626$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Borgwardt, Stefan</creatorcontrib><creatorcontrib>Mailis, Theofilos</creatorcontrib><creatorcontrib>Peñaloza, Rafael</creatorcontrib><creatorcontrib>Turhan, Anni-Yasmin</creatorcontrib><title>Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies</title><description>Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known technique that reduces the fuzzy ontology to a classical one, and use classical DL reasoners as a black box. We improve the complexity of previous reduction techniques for finitely valued fuzzy DLs, which allows us to prove tight complexity results for answering certain kinds of fuzzy CQs. We conclude with an experimental evaluation of a prototype implementation, showing the feasibility of our approach.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tqwzAURLXJoiT9gK6qH7Crh6-sLIOp20AgFEK3RpWug4IjB_nROl9fN81qYOYwcAh54izNNAB7MfHHjykHplMmlFAPZLsJ3TdGH460HK7XiRZtOA3B9n5E-jHMC3a0HTHS0gffYzPRT9MM6O74PvRt0x5nakUWtWk6fLznkhzK10Pxnuz2b9tis0uMylUCHLJcSISMOf4luQTUyuZ6bjRoJ4yFXLi1FsoAZ9zWvEZwUDvJnMmsk0vy_H97c6ku0Z9NnKo_p-rmJH8BNABHVA</recordid><startdate>20150811</startdate><enddate>20150811</enddate><creator>Borgwardt, Stefan</creator><creator>Mailis, Theofilos</creator><creator>Peñaloza, Rafael</creator><creator>Turhan, Anni-Yasmin</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20150811</creationdate><title>Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies</title><author>Borgwardt, Stefan ; Mailis, Theofilos ; Peñaloza, Rafael ; Turhan, Anni-Yasmin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-5154723e540d1b3135e86c783e5858d2ac572d9826a5101cf1fe5d5fd30da4cd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Borgwardt, Stefan</creatorcontrib><creatorcontrib>Mailis, Theofilos</creatorcontrib><creatorcontrib>Peñaloza, Rafael</creatorcontrib><creatorcontrib>Turhan, Anni-Yasmin</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Borgwardt, Stefan</au><au>Mailis, Theofilos</au><au>Peñaloza, Rafael</au><au>Turhan, Anni-Yasmin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies</atitle><date>2015-08-11</date><risdate>2015</risdate><abstract>Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite chains of degrees of truth. To answer such queries, we extend a well-known technique that reduces the fuzzy ontology to a classical one, and use classical DL reasoners as a black box. We improve the complexity of previous reduction techniques for finitely valued fuzzy DLs, which allows us to prove tight complexity results for answering certain kinds of fuzzy CQs. We conclude with an experimental evaluation of a prototype implementation, showing the feasibility of our approach.</abstract><doi>10.48550/arxiv.1508.02626</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1508.02626
ispartof
issn
language eng
recordid cdi_arxiv_primary_1508_02626
source arXiv.org
subjects Computer Science - Artificial Intelligence
Computer Science - Logic in Computer Science
title Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T19%3A08%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Answering%20Fuzzy%20Conjunctive%20Queries%20over%20Finitely%20Valued%20Fuzzy%20Ontologies&rft.au=Borgwardt,%20Stefan&rft.date=2015-08-11&rft_id=info:doi/10.48550/arxiv.1508.02626&rft_dat=%3Carxiv_GOX%3E1508_02626%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true