This HTML5 document contains 24 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
n16http://purl.org/ontology/bibo/status/
n13https://kar.kent.ac.uk/90808/
n19https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n17https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n4http://eprints.org/ontology/
bibohttp://purl.org/ontology/bibo/
n18https://kar.kent.ac.uk/id/publication/
n7https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15doi:10.1016/
owlhttp://www.w3.org/2002/07/owl#
n9https://kar.kent.ac.uk/id/eprint/90808#
n8https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n6https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:90808
rdf:type
bibo:AcademicArticle n4:EPrint bibo:Article n4:ArticleEPrint
rdfs:seeAlso
n13:
owl:sameAs
n15:j.artint.2018.09.003
dcterms:title
Query inseparability for \(ALC\) ontologies
wdrs:describedby
n11:export_kar_RDFN3.n3 n17:export_kar_RDFN3.n3
dcterms:date
2019-07-01
dcterms:creator
n6:ext-06edae310b90718d29aac8b18ac9b2f5 n6:ext-c3181b61d14303ac3f9854a8c6d7ea38 n6:ext-e.botoeva@kent.ac.uk n6:ext-37b5b23f9d82f675feee0cd6318cc2fc n6:ext-17b84d349d11a2d9f7b58d76178b82a0
bibo:status
n16:peerReviewed n16:published
dcterms:publisher
n7:ext-f308aad1ef8f70546c3a197f104f2ad5
bibo:abstract
We investigate the problem whether two \(ALC\) ontologies are indistinguishable (or inseparable) by means of queries in a given signature, which is fundamental for ontology engineering tasks such as ontology versioning, modularisation, update, and forgetting. We consider both knowledge base (KB) and TBox inseparability. For KBs, we give model-theoretic criteria in terms of (finite partial) homomorphisms and products and prove that this problem is undecidable for conjunctive queries (CQs), but 2ExpTime-complete for unions of CQs (UCQs). The same results hold if (U)CQs are replaced by rooted (U)CQs, where every variable is connected to an answer variable. We also show that inseparability by CQs is still undecidable if one KB is given in the lightweight DL \(EL\) and if no restrictions are imposed on the signature of the CQs. We also consider the problem whether two \(ALC\) TBoxes give the same answers to any query over any ABox in a given signature and show that, for CQs, this problem is undecidable, too. We then develop model-theoretic criteria for Horn \(ALC\) TBoxes and show using tree automata that, in contrast, inseparability becomes decidable and 2ExpTime-complete, even ExpTime-complete when restricted to (unions of) rooted CQs.
dcterms:isPartOf
n8:repository n18:ext-00043702
dcterms:subject
n19:QA76.9.H85
bibo:authorList
n9:authors
bibo:volume
272