Probabilistic Description Logics for Subjective Uncertainty
نویسندگان
چکیده
We propose a family of probabilistic description logics (DLs) that are derived in a principled way from Halpern’s probabilistic first-order logic. The resulting probabilistic DLs have a two-dimensional semantics similar to temporal DLs and are well-suited for representing subjective probabilities. We carry out a detailed study of reasoning in the new family of logics, concentrating on probabilistic extensions of the DLs ALC and EL, and showing that the complexity ranges from PTime via ExpTime and 2ExpTime to undecidable.
منابع مشابه
Handling uncertainty: An extension of DL-Lite with Subjective Logic
Data in real world applications is often subject to some kind of uncertainty, which can be due to incompleteness, unreliability or inconsistency. This poses a great challenge for ontology-based data access (OBDA) applications, which are expected to provide a meaningful answers to queries, even under uncertain domains. Several extensions of classical OBDA systems has been proposed to address thi...
متن کاملComputing Subjective Expected Utility using Probabilistic Description Logics
We introduce a framework which is based on probabilistic Description logics (Prob-DL), to represent and solve multi-criteria discrete alternative problems by calculating expected utility. To our knowledge, this is the first ever approach for calculating expected utility using a Description logics based formalism.
متن کاملDynamic Bayesian Description Logics
It is well known that many artificial intelligence applications need to represent and reason with knowledge that is not fully certain. This has motivated the study of many knowledge representation formalisms that can effectively handle uncertainty, and in particular probabilistic description logics (DLs) [7–9]. Although these logics are encompassed under the same umbrella, they differ greatly i...
متن کاملTractable Reasoning with Bayesian Description Logics
The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the DL-Lite description logics, which is based on Bayesian networks. As an important feature, the new probabilistic description logics allow for flexibly combining terminological and assertional pieces of probabilistic knowledg...
متن کاملLearning Probabilistic Description Logics: A Framework and Algorithms
Description logics have become a prominent paradigm in knowledge representation (particularly for the Semantic Web), but they typically do not include explicit representation of uncertainty. In this paper, we propose a framework for automatically learning a Probabilistic Description Logic from data. We argue that one must learn both concept definitions and probabilistic assignments. We also pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artif. Intell. Res.
دوره 58 شماره
صفحات -
تاریخ انتشار 2010