Add to ORKGDeciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL
The OWL2 profile OWL 2 QL, based on the DL-Lite family of description logics, is emerging as a major...
International audienceAn important issue that arises when querying description logic (DL) knowledge ...
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and ne...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive quer...
We consider conjunctive query inseparability of description logic knowledge bases with respect to a ...
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with...
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with...
We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with resp...
We consider conjunctive query inseparability of description logic knowledge bases with respect to a ...
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a g...
We investigate the problem whether two ALC ontologies are indistinguishable (or inseparable) by mean...
We study the data complexity of answering conjunctive queries over Description Logic knowledge bases...
We study the data complexity of answering con-junctive queries over Description Logic knowledge base...
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider...
The OWL2 profile OWL 2 QL, based on the DL-Lite family of description logics, is emerging as a major...
International audienceAn important issue that arises when querying description logic (DL) knowledge ...
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and ne...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive quer...
We consider conjunctive query inseparability of description logic knowledge bases with respect to a ...
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with...
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with...
We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with resp...
We consider conjunctive query inseparability of description logic knowledge bases with respect to a ...
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a g...
We investigate the problem whether two ALC ontologies are indistinguishable (or inseparable) by mean...
We study the data complexity of answering conjunctive queries over Description Logic knowledge bases...
We study the data complexity of answering con-junctive queries over Description Logic knowledge base...
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider...
The OWL2 profile OWL 2 QL, based on the DL-Lite family of description logics, is emerging as a major...
International audienceAn important issue that arises when querying description logic (DL) knowledge ...
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and ne...