Ontology-Enriched Data Management with Partially Complete Data

Sanja Pavlovic
2019 International Web Rule Symposium  
As fragments of first-order logic, description logics (DLs) make the assumption that what is not known to be true is unknown (open-world assumption). This is adequate when dealing with inherently incomplete data. However, if the data is assumed to be complete, it is more appropriate to employ the closed-world assumption (CWA) stating that what is not known must be false. Real world applications often require that incomplete parts of the data interact with the parts known to be complete, which
more » ... lls for formalisms that simultaneously support both of these assumptions. In DLs this can be done by specifying which predicates should be interpreted under the closed-world view. The goal of this paper is to outline the research questions related to DLs with partial CWA that we plan to investigate. Our primary focus will be on characterizing computational complexity and relative expressiveness of ontology-mediated queries in the presence of closed predicates, but we also plan to investigate the interactions between closed-predicates and number restrictions. Finally, we develop formalisms based on DLs with CWA to reason about actions and change.
dblp:conf/ruleml/Pavlovic19 fatcat:6k7lcbkchbelraqelcu33frpry