Abstract. Reasoning in complex DLs is well known to be expensive. However, in numerous application scenarios, the ontology in use is ei-ther never modified at all (e.g., in query answering), or the amount of updates is negligible in comparison with the whole ontology (e.g., minor manual edits, addition of a few individuals). In order to efficiently sup-port these scenarios, FaCT++ implements the following two techniques: persistent and incremental reasoning. In persistent reasoning mode, after classification, the reasoner saves its internal state, including computed information (e.g., concept taxonomy) on a persistent medium; the next use of the ontology will not require classification to be performed from scratch, but just reading an input...
Abstract. We propose an incremental reasoning approach to QL ontologies by mapping an evolving ontol...
Reasoning and change over inconsistent ontologies (i-ont(s)) is of utmost relevance in sciences like...
The benefits of modular representations are well known from many areas of computer science. In this ...
Abstract. The development of ontologies involves continuous but relatively small modifications. Exis...
The development of ontologies involves continuous but relatively small modifications. However, exist...
This article presents a technique for Stream Reasoning, consisting in incremental maintenance of mat...
This paper discusses the incremental maintenance of materialized ontologies in a rule-enabled Semant...
This paper discusses the incremental maintenance of materialized ontologies in a rule-enabled Semant...
International audienceIn SemanticWeb applications, reasoning engines that are data intensive commonl...
Abstract. This is a system description of the Description Logic reasoner FaCT++. The reasoner implem...
A distinctive property of relational database systems is the ability to perform data updates and que...
International audienceThe Semantic Web enables to describe knowledge from data and leverage implicit...
Reasoning in descriptive logic (DL) ontologies is known to be intractable in the worst-case. This po...
As classical reasoning from inconsistent ontologies can't give meaningful answers to queries, it is ...
We investigate cases where an ontology expressed in a seemingly hard DL can be polynomially reduced ...
Abstract. We propose an incremental reasoning approach to QL ontologies by mapping an evolving ontol...
Reasoning and change over inconsistent ontologies (i-ont(s)) is of utmost relevance in sciences like...
The benefits of modular representations are well known from many areas of computer science. In this ...
Abstract. The development of ontologies involves continuous but relatively small modifications. Exis...
The development of ontologies involves continuous but relatively small modifications. However, exist...
This article presents a technique for Stream Reasoning, consisting in incremental maintenance of mat...
This paper discusses the incremental maintenance of materialized ontologies in a rule-enabled Semant...
This paper discusses the incremental maintenance of materialized ontologies in a rule-enabled Semant...
International audienceIn SemanticWeb applications, reasoning engines that are data intensive commonl...
Abstract. This is a system description of the Description Logic reasoner FaCT++. The reasoner implem...
A distinctive property of relational database systems is the ability to perform data updates and que...
International audienceThe Semantic Web enables to describe knowledge from data and leverage implicit...
Reasoning in descriptive logic (DL) ontologies is known to be intractable in the worst-case. This po...
As classical reasoning from inconsistent ontologies can't give meaningful answers to queries, it is ...
We investigate cases where an ontology expressed in a seemingly hard DL can be polynomially reduced ...
Abstract. We propose an incremental reasoning approach to QL ontologies by mapping an evolving ontol...
Reasoning and change over inconsistent ontologies (i-ont(s)) is of utmost relevance in sciences like...
The benefits of modular representations are well known from many areas of computer science. In this ...