• Aucun résultat trouvé

Easy Keys for OWL

N/A
N/A
Protected

Academic year: 2022

Partager "Easy Keys for OWL"

Copied!
12
0
0

Texte intégral

Références

Documents relatifs

On the same cover sheet, please put your name, student number, and name of the degree (Maths/TP/TSM), and staple all the sheets together. (Failure to do that may result

In addition, we pretend to offer a way to keep the uncertainty information iso- lated as much as possible from the traditional ontology. With this policy, we want to ease

Moreover, HermiT employs a novel classification algo- rithm that greatly reduces the number of subsumption (and hence satisfiability) tests needed to classify a given ontology..

The idea behind DL-safe variable SWRL is now to identify those variables in rule bodies which violate the required tree structure, and to define the semantics of the rules such

In order to support an early acceptance of the OWL 1.1 ontology language, we present DeLorean, the first reasoner that supports a fuzzy extension of the Description Logic SROIQ

The OWL [2] datatype formalism (or simply OWL datatyping ) presents some new requirements for DL reasoning services, in terms of semantics (to allow the use of so- called

Thus, based on our previous experience in the evalua- tion of reasoners on mobile devices [5,14], we propose to consider the following tasks: consistency checking (considered in the

In order to improve the recovery rate of waste products and maximize the social welfare, this paper investigates the problem of government setting a recovery rate threshold for