Home » Research » Research outputs » The Bayesian Description Logic BALC

The Bayesian Description Logic BALC


  • Authors:
    Botha, L , Tommie Meyer , Penaloza, R

    Publication date:

    CSIR Meraka Institute, UCT

    Output type:
    Conference proceedings


    Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternatives, thereby limiting their use in real world domains. The Bayesian DL BEL and its extensions have been introduced to deal with uncertain knowledge without assuming (probabilistic) independence between axioms. In this paper we combine the classical DL ALC with Bayesian Networks. Our new DL includes a solution to the consistency checking problem and changes to the tableaux algorithm that are not a part of BEL. Furthermore, BALC also supports probabilistic assertional information which was not studied for BEL. We present algorithms for four categories of reasoning problems for our logic; two versions of concept satisability (referred to as total concept satis- ability and partial concept satisability respectively), knowledge base consistency, subsumption, and instance checking. We show 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.

    Document file:
    Proof of peer-review from publisher: