Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
DevelopinThe Bayesian Description Logic BALC
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,...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Computer Science
2019
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613236031913984 |
|---|---|
| access_status_str | Open Access |
| author | Botha, Leonard |
| author2 | Meyer, Thomas |
| author_browse | Botha, Leonard Meyer, Thomas |
| author_facet | Meyer, Thomas Botha, Leonard |
| author_sort | Botha, Leonard |
| collection | Thesis |
| description | 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. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/29350 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:32:56.154Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2019 |
| publishDateRange | 2019 |
| publishDateSort | 2019 |
| publisher | Department of Computer Science |
| publisherStr | Department of Computer Science |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/29350 DevelopinThe Bayesian Description Logic BALC Botha, Leonard Meyer, Thomas Peñaloza, Rafael computer science 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. 2019-02-06T09:31:29Z 2019-02-06T09:31:29Z 2018 2019-02-05T09:23:50Z Master Thesis Masters MSc http://hdl.handle.net/11427/29350 eng application/pdf Department of Computer Science Faculty of Science University of Cape Town |
| spellingShingle | computer science Botha, Leonard DevelopinThe Bayesian Description Logic BALC |
| thesis_degree_str | Master's |
| title | DevelopinThe Bayesian Description Logic BALC |
| title_full | DevelopinThe Bayesian Description Logic BALC |
| title_fullStr | DevelopinThe Bayesian Description Logic BALC |
| title_full_unstemmed | DevelopinThe Bayesian Description Logic BALC |
| title_short | DevelopinThe Bayesian Description Logic BALC |
| title_sort | developinthe bayesian description logic balc |
| topic | computer science |
| url | http://hdl.handle.net/11427/29350 |
| work_keys_str_mv | AT bothaleonard developinthebayesiandescriptionlogicbalc |