Pages that link to "Item:Q673387"

The following pages link to Answering queries from context-sensitive probabilistic knowledge bases (Q673387):

Displaying 19 items.

• On the complexity of propositional and relational credal networks (Q518627) (← links)
• Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
• Mixed deterministic and probabilistic networks (Q841632) (← links)
• Learning to assign degrees of belief in relational domains (Q1009279) (← links)
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• Learning directed relational models with recursive dependencies (Q1945140) (← links)
• On the complexity of inference about probabilistic relational models (Q1978655) (← links)
• Causal learning with Occam's razor (Q2009770) (← links)
• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
• P-log: refinement and a new coherency condition (Q2317975) (← links)
• Probabilistic logic with independence (Q2379311) (← links)
• Probabilistic description logic programs under inheritance with overriding for the semantic Web (Q2379312) (← links)
• Graphical models for imprecise probabilities (Q2386115) (← links)
• MEBN: a language for first-order Bayesian knowledge bases (Q2389617) (← links)
• Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
• Markov logic networks (Q2491364) (← links)
• CP-logic: A language of causal probabilistic events and its relation to logic programming (Q3393227) (← links)
• Learning Distributional Programs for Relational Autocompletion (Q6063874) (← links)