An ExpSpace Tableau-based Algorithm for SHOIQ

International audienceIn this paper, we propose an EXPSPACE tableau-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableau-based method for SHOIQ and the technique used for designing a NEXPTIME algorithm for the two-variable fragment of first-order logic with counting quantifiers C2

An ExpSpace Tableau-based Algorithm for SHOIQ

In this work, we propose an ExpSpace tableau-based algorithm for deciding consistency of a knowledge base in the description logic SHOIQ. The construction of this algorithm is founded on the standard tableau-based method for SHOIQ and the technique used for designing a NExpTime algorithm for the two-variable fragment of first-order logic with counting quantifiers C^2.Cer article propose un algorithme ExpSpace basé sur tableaux pour vérifier la cohérence d'une base de connaissances en SHOIQ

An ExpSpace Tableau-based Algorithm for SHOIQ

International audienceIn this paper, we propose an EXPSPACE tableau-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableau-based method for SHOIQ and the technique used for designing a NEXPTIME algorithm for the two-variable fragment of first-order logic with counting quantifiers C2

An ExpSpace Tableau-based Algorithm for SHOIQ

In this work, we propose an ExpSpace tableau-based algorithm for deciding consistency of a knowledge base in the description logic SHOIQ. The construction of this algorithm is founded on the standard tableau-based method for SHOIQ and the technique used for designing a NExpTime algorithm for the two-variable fragment of first-order logic with counting quantifiers C^2.Cer article propose un algorithme ExpSpace basé sur tableaux pour vérifier la cohérence d'une base de connaissances en SHOIQ

An EXPSPACE Tableau-based Algorithm for SHOIQ

Abstract. In this paper, we propose an EXPSPACE tableau-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableaubased method for SHOIQ and the technique used for designing a NEXPTIME algorithm for the two-variable fragment of first-order logic with counting quantifiers C 2.

OPTIMIZATION OF NONSTANDARD REASONING SERVICES

The increasing adoption of semantic technologies and the corresponding increasing complexity of application requirements are motivating extensions to the standard reasoning paradigms and services supported by such technologies. This thesis focuses on two of such extensions: nonmonotonic reasoning and inference-proof access control. Expressing knowledge via general rules that admit exceptions is an approach that has been commonly adopted for centuries in areas such as law and science, and more recently in object-oriented programming and computer security. The experiences in developing complex biomedical knowledge bases reported in the literature show that a direct support to defeasible properties and exceptions would be of great help. On the other hand, there is ample evidence of the need for knowledge confidentiality measures. Ontology languages and Linked Open Data are increasingly being used to encode the private knowledge of companies and public organizations. Semantic Web techniques facilitate merging different sources of knowledge and extract implicit information, thereby putting at risk security and the privacy of individuals. But the same reasoning capabilities can be exploited to protect the confidentiality of knowledge. Both nonmonotonic inference and secure knowledge base access rely on nonstandard reasoning procedures. The design and realization of these algorithms in a scalable way (appropriate to the ever-increasing size of ontologies and knowledge bases) is carried out by means of a diversified range of optimization techniques such as appropriate module extraction and incremental reasoning. Extensive experimental evaluation shows the efficiency of the developed optimization techniques: (i) for the first time performance compatible with real-time reasoning is obtained for large nonmonotonic ontologies, while (ii) the secure ontology access control proves to be already compatible with practical use in the e-health application scenario.