Add to ORKGWe study the problem of reasoning in the probabilistic De-scription Logic BEL. Using a novel structure, we show that probabilistic reasoning in this logic can be reduced in poly-nomial time to standard inferences over a Bayesian network. This reduction provides tight complexity bounds for proba-bilistic reasoning in BEL.
Probabilistic logics have attracted a great deal of attention during the past few years. Where logic...
Knowledge representation languages invariably reflect a trade-off between expressivity and tractabil...
We present a method for dynamically constructing Bayesian networks from knowledge bases consisting o...
Abstract. Recently, Bayesian extensions of Description Logics, and in particular the logic BEL, were...
We introduce the new probabilistic description logic (DL) BEL, which extends the light-weight DL EL ...
Abstract. We introduce the probabilistic Description Logic BEL. In BEL, axioms are required to hold ...
Abstract. The Bayesian Description Logic (BDL) BEL is a probabilistic DL, which extends the lightwei...
Abstract. We present Bayesian Description Logics (BDLs): an exten-sion of Description Logics (DLs) w...
We describe how to combine probabilistic logic and Bayesian networks to obtain a new frame-work ("Ba...
The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and ...
Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternative...
This paper presents a new approach to inference in Bayesian networks with Boolean variables. The pri...
By identifying and pursuing analogies between causal and logical in uence I show how the Bayesian ne...
We present a method for dynamically generating Bayesian networks from knowledge bases consisting of ...
Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternative...
Probabilistic logics have attracted a great deal of attention during the past few years. Where logic...
Knowledge representation languages invariably reflect a trade-off between expressivity and tractabil...
We present a method for dynamically constructing Bayesian networks from knowledge bases consisting o...
Abstract. Recently, Bayesian extensions of Description Logics, and in particular the logic BEL, were...
We introduce the new probabilistic description logic (DL) BEL, which extends the light-weight DL EL ...
Abstract. We introduce the probabilistic Description Logic BEL. In BEL, axioms are required to hold ...
Abstract. The Bayesian Description Logic (BDL) BEL is a probabilistic DL, which extends the lightwei...
Abstract. We present Bayesian Description Logics (BDLs): an exten-sion of Description Logics (DLs) w...
We describe how to combine probabilistic logic and Bayesian networks to obtain a new frame-work ("Ba...
The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and ...
Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternative...
This paper presents a new approach to inference in Bayesian networks with Boolean variables. The pri...
By identifying and pursuing analogies between causal and logical in uence I show how the Bayesian ne...
We present a method for dynamically generating Bayesian networks from knowledge bases consisting of ...
Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternative...
Probabilistic logics have attracted a great deal of attention during the past few years. Where logic...
Knowledge representation languages invariably reflect a trade-off between expressivity and tractabil...
We present a method for dynamically constructing Bayesian networks from knowledge bases consisting o...