SROIQsigma is decidable

We consider a dynamic extension of the description logic \(\mathcal{SROIQ}\). This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called \(\...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2014-11
Main Authors: Brenas, Jon Haël, Echahed, Rachid, Strecker, Martin
Format: Article
Language:English
Subjects:
Deletion
Substitutes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Brenas, Jon Haël
Echahed, Rachid
Strecker, Martin
description We consider a dynamic extension of the description logic \(\mathcal{SROIQ}\). This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called \(\mathcal{SROIQ}\) with explicit substitutions and is written \(\mathcal{SROIQ^\sigma}\). Substitution is not treated as meta-operation that is carried out immediately, but the operation of substitution may be delayed, so that sub-formulae of \(\mathcal{SROIQ}^\sigma\) are of the form \(\Phi\sigma\), where \(\Phi\) is a \(\mathcal{SROIQ}\) formula and \(\sigma\) is a substitution which encodes changes of concepts and roles. In this paper, we particularly prove that the satisfiability problem of \(\mathcal{SROIQ}^\sigma\) is decidable.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2084772455</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2084772455</sourcerecordid><originalsourceid>FETCH-proquest_journals_20847724553</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQQDw7y9wwszkzPTVTILFZISU3OTElMyknlYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwMLE3NzIxOgecSpAgD6Lik8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2084772455</pqid></control><display><type>article</type><title>SROIQsigma is decidable</title><source>Publicly Available Content Database</source><creator>Brenas, Jon Haël ; Echahed, Rachid ; Strecker, Martin</creator><creatorcontrib>Brenas, Jon Haël ; Echahed, Rachid ; Strecker, Martin</creatorcontrib><description>We consider a dynamic extension of the description logic \(\mathcal{SROIQ}\). This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called \(\mathcal{SROIQ}\) with explicit substitutions and is written \(\mathcal{SROIQ^\sigma}\). Substitution is not treated as meta-operation that is carried out immediately, but the operation of substitution may be delayed, so that sub-formulae of \(\mathcal{SROIQ}^\sigma\) are of the form \(\Phi\sigma\), where \(\Phi\) is a \(\mathcal{SROIQ}\) formula and \(\sigma\) is a substitution which encodes changes of concepts and roles. In this paper, we particularly prove that the satisfiability problem of \(\mathcal{SROIQ}^\sigma\) is decidable.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Deletion ; Substitutes</subject><ispartof>arXiv.org, 2014-11</ispartof><rights>2014. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2084772455?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Brenas, Jon Haël</creatorcontrib><creatorcontrib>Echahed, Rachid</creatorcontrib><creatorcontrib>Strecker, Martin</creatorcontrib><title>SROIQsigma is decidable</title><title>arXiv.org</title><description>We consider a dynamic extension of the description logic \(\mathcal{SROIQ}\). This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called \(\mathcal{SROIQ}\) with explicit substitutions and is written \(\mathcal{SROIQ^\sigma}\). Substitution is not treated as meta-operation that is carried out immediately, but the operation of substitution may be delayed, so that sub-formulae of \(\mathcal{SROIQ}^\sigma\) are of the form \(\Phi\sigma\), where \(\Phi\) is a \(\mathcal{SROIQ}\) formula and \(\sigma\) is a substitution which encodes changes of concepts and roles. In this paper, we particularly prove that the satisfiability problem of \(\mathcal{SROIQ}^\sigma\) is decidable.</description><subject>Deletion</subject><subject>Substitutes</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQQDw7y9wwszkzPTVTILFZISU3OTElMyknlYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwMLE3NzIxOgecSpAgD6Lik8</recordid><startdate>20141121</startdate><enddate>20141121</enddate><creator>Brenas, Jon Haël</creator><creator>Echahed, Rachid</creator><creator>Strecker, Martin</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20141121</creationdate><title>SROIQsigma is decidable</title><author>Brenas, Jon Haël ; Echahed, Rachid ; Strecker, Martin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20847724553</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Deletion</topic><topic>Substitutes</topic><toplevel>online_resources</toplevel><creatorcontrib>Brenas, Jon Haël</creatorcontrib><creatorcontrib>Echahed, Rachid</creatorcontrib><creatorcontrib>Strecker, Martin</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brenas, Jon Haël</au><au>Echahed, Rachid</au><au>Strecker, Martin</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>SROIQsigma is decidable</atitle><jtitle>arXiv.org</jtitle><date>2014-11-21</date><risdate>2014</risdate><eissn>2331-8422</eissn><abstract>We consider a dynamic extension of the description logic \(\mathcal{SROIQ}\). This means that interpretations could evolve thanks to some actions such as addition and/or deletion of an element (respectively, a pair of elements) of a concept (respectively, of a role). The obtained logic is called \(\mathcal{SROIQ}\) with explicit substitutions and is written \(\mathcal{SROIQ^\sigma}\). Substitution is not treated as meta-operation that is carried out immediately, but the operation of substitution may be delayed, so that sub-formulae of \(\mathcal{SROIQ}^\sigma\) are of the form \(\Phi\sigma\), where \(\Phi\) is a \(\mathcal{SROIQ}\) formula and \(\sigma\) is a substitution which encodes changes of concepts and roles. In this paper, we particularly prove that the satisfiability problem of \(\mathcal{SROIQ}^\sigma\) is decidable.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2014-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2084772455
source Publicly Available Content Database
subjects Deletion
Substitutes
title SROIQsigma is decidable
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T17%3A52%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=SROIQsigma%20is%20decidable&rft.jtitle=arXiv.org&rft.au=Brenas,%20Jon%20Ha%C3%ABl&rft.date=2014-11-21&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2084772455%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20847724553%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2084772455&rft_id=info:pmid/&rfr_iscdi=true