Answering queries from context-sensitive probabilistic knowledge bases
From MaRDI portal
Publication:673387
DOI10.1016/S0304-3975(96)00128-4zbMath0874.68280MaRDI QIDQ673387
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Bayesian networksLogic programmingdeclarative semanticsProbability model constructionquery answering procedureReasoning under uncertaintyrepresentation of context-sensitive probabilistic knowledge
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Related Items
Mixed deterministic and probabilistic networks, Probabilistic logic with independence, Probabilistic description logic programs under inheritance with overriding for the semantic Web, Graphical models for imprecise probabilities, MEBN: a language for first-order Bayesian knowledge bases, Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence, Learning Distributional Programs for Relational Autocompletion, Learning directed relational models with recursive dependencies, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, The complexity of Bayesian networks specified by propositional and relational languages, A Comparison between Two Statistical Relational Models, On the complexity of inference about probabilistic relational models, On the complexity of propositional and relational credal networks, Causal learning with Occam's razor, A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages, Markov logic networks, Probabilistic reasoning with answer sets, Probabilistic Inductive Logic Programming, New Advances in Logic-Based Probabilistic Modeling by PRISM, Basic Principles of Learning Bayesian Logic Programs, Learning to assign degrees of belief in relational domains, CP-logic: A language of causal probabilistic events and its relation to logic programming, P-log: refinement and a new coherency condition, Approximate well-founded semantics, query answering and generalized normal logic programs over lattices, Combining probabilistic logic programming with the power of maximum entropy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic logic programming
- Probabilistic Horn abduction and Bayesian networks
- The computational complexity of probabilistic inference using Bayesian belief networks
- Quantitative deduction and its fixpoint theory
- Probabilistic Inference and Influence Diagrams
- Bilattices and the semantics of logic programming
- The well-founded semantics for general logic programs