The Experts below are selected from a list of 1911 Experts worldwide ranked by ideXlab platform

Krishnaprasad Thirunarayan - One of the best experts on this subject based on the ideXlab platform.

  • Tableau Algorithm for Concept Satisfiability in Description Logic ALCH
    2016
    Co-Authors: Core Scholar, Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    Abstract. The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenanc

  • tableau algorithm for Concept Satisfiability in
    2009
    Co-Authors: Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenance ontologies that extend provenir ontology.

  • tableau algorithm for Concept Satisfiability in description logic alch
    2009
    Co-Authors: Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenance ontologies that extend provenir ontology.

Satya S Sahoo - One of the best experts on this subject based on the ideXlab platform.

  • Tableau Algorithm for Concept Satisfiability in Description Logic ALCH
    2016
    Co-Authors: Core Scholar, Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    Abstract. The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenanc

  • tableau algorithm for Concept Satisfiability in
    2009
    Co-Authors: Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenance ontologies that extend provenir ontology.

  • tableau algorithm for Concept Satisfiability in description logic alch
    2009
    Co-Authors: Satya S Sahoo, Krishnaprasad Thirunarayan
    Abstract:

    The provenir ontology is an upper-level ontology to facilitate interoperability of provenance information in scientific applications. The description logic (DL) expressivity of provenir ontology is ALCH, that is, it models role hierarchies (H) (without transitive roles and inverse roles). Even though the complexity results for Concept Satisfiability for numerous variants of DL such as ALC with transitively closed roles (ALCR+ also called S), inverse roles SI, and role hierarchy SHI have been well-established, similar results for ALCH has been surprisingly missing from the literature. Here, we show that the complexity of the Concept Satisfiability problem for the ALCH variant of DL is PSpace complete. This result contributes towards a complete set of complexity results for DL variants and establishes a lower bound on complexity for domain-specific provenance ontologies that extend provenir ontology.

Ralf Moller - One of the best experts on this subject based on the ideXlab platform.

  • a hybrid tableau algorithm for alcq
    European Conference on Artificial Intelligence, 2008
    Co-Authors: Jocelyne Faddoul, Nasim Farsinia, Volker Haarslev, Ralf Moller
    Abstract:

    We propose an approach for extending a tableau-based Satisfiability algorithm by an arithmetic component. The result is a hybrid Concept Satisfiability algorithm for the Description Logic (DL) ALCQ which extends ALC with qualified number restrictions. The hybrid approach ensures a more informed calculus which, on the one hand, adequately handles the interaction between numerical and logical restrictions of descriptions, and on the other hand, when applied is a very promising framework for average case optimizations.

Botha Leonard - One of the best experts on this subject based on the ideXlab platform.

  • DevelopinThe Bayesian Description Logic BALC
    Department of Computer Science, 2019
    Co-Authors: Botha Leonard
    Abstract:

    Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternatives. This limits their application in many real world domains, which often require reasoning about uncertain or contradictory information. In this thesis we present the Bayesian Description Logic BALC, which takes existing work on Bayesian Description Logics and applies it to the classical Description Logic ALC. We define five reasoning problems for BALC; two versions of Concept Satisfiability (called total and partial respectively), knowledge base consistency, three subsumption problems (positive subsumption, p-subsumption, exact subsumption), instance checking, and the most likely context problem. Consistency, Satisfiability, and instance checking have not previously been studied in the context of contextual Bayesian DLs and as such this is new work. We then go on to provide algorithms that solve all of these reasoning problems, with the exception of the most likely context problem. We found that all reasoning problems in BALC are in the same complexity class as their classical variants, provided that the size of the Bayesian Network is included in the size of the knowledge base. That is, all reasoning problems mentioned above (excluding most likely context) are exponential in the size of the knowledge base and the size of the Bayesian Network

Thomas Schneider - One of the best experts on this subject based on the ideXlab platform.

  • Generalized Satisfiability for the Description Logic ALC
    2015
    Co-Authors: Arne Meier, Thomas Schneider
    Abstract:

    Abstract. The standard reasoning problem, Concept Satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier Satisfiability problem; sometimes it is even tractable. We classify the complexity of the standard Satisfiability problems for all possible Boolean and quantifier fragments of ALC in the presence of general axioms.

  • Generalized Satisfiability for the Description Logic ALC
    2014
    Co-Authors: Arne Meier, Thomas Schneider
    Abstract:

    The standard reasoning problem, Concept Satisfiability, in the basic description logic ALC is PSpace-complete, and it is ExpTime-complete in the presence of general Concept inclusions. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier Satisfiability problem; for some of these logics, Satisfiability can be decided in polynomial time. We classify the complexity of the standard variants of the Satisfiability problem for all possible Boolean and quantifier fragments of ALC with and without general Concept inclusions