Add to ORKGExisting description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refine
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
The tableaux algorithm is a general technique for deciding concept satisfiability problems in descri...
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to ...
For ontologies represented as Description Logic Tboxes, op-timised DL reasoners are able to detect l...
AbstractDescription Logics are a family of logics used to represent and reason about conceptual and ...
The Web Ontology Languages define a rich machine readable language for knowledge representation on t...
Description Logics are a family of logics used to represent and reason about conceptual and termino...
Abstract. Although state-of-the-art description logic (DL) reasoners are equipped with a comprehensi...
AbstractThe last years have seen two major advances in Knowledge Representation and Reasoning. First...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Abstract. We present a tableau algorithm for the description logic ALCOV. This description logic is ...
Description Logics (DLs) are a family of languages used for the representation and for reasoning abo...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Abstract. The provenir ontology is an upper-level ontology to facilitate interoperability of provena...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
The tableaux algorithm is a general technique for deciding concept satisfiability problems in descri...
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to ...
For ontologies represented as Description Logic Tboxes, op-timised DL reasoners are able to detect l...
AbstractDescription Logics are a family of logics used to represent and reason about conceptual and ...
The Web Ontology Languages define a rich machine readable language for knowledge representation on t...
Description Logics are a family of logics used to represent and reason about conceptual and termino...
Abstract. Although state-of-the-art description logic (DL) reasoners are equipped with a comprehensi...
AbstractThe last years have seen two major advances in Knowledge Representation and Reasoning. First...
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoreti...
Abstract. We present a tableau algorithm for the description logic ALCOV. This description logic is ...
Description Logics (DLs) are a family of languages used for the representation and for reasoning abo...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Abstract. The provenir ontology is an upper-level ontology to facilitate interoperability of provena...
In this paper we investigate the consequence-based algorithms that are nowadays commonly used for su...
Abstract. Extensions of the description logic EL have recently been proposed as lightweight ontology...
The tableaux algorithm is a general technique for deciding concept satisfiability problems in descri...
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to ...