Answering queries from context-sensitive probabilistic knowledge bases

DOI10.1016/S0304-3975(96)00128-4zbMATH Open0874.68280MaRDI QIDQ673387FDOQ673387

Liem Ngo, Peter Haddawy

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Bayesian networksdeclarative semanticsLogic programmingProbability model constructionquery answering procedureReasoning under uncertaintyrepresentation of context-sensitive probabilistic knowledge

Mathematics Subject Classification ID

Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• Probabilistic Inference and Influence Diagrams
• Bilattices and the semantics of logic programming
• 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

Cited In (27)

• P-log: refinement and a new coherency condition
• MEBN: a language for first-order Bayesian knowledge bases
• Graphical models for imprecise probabilities
• Probabilistic Inductive Logic Programming
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• On the complexity of inference about probabilistic relational models
• Mixed deterministic and probabilistic networks
• Causal learning with Occam's razor
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Basic Principles of Learning Bayesian Logic Programs
• Languages for probabilistic modeling over structured and relational domains
• Learning to assign degrees of belief in relational domains
• Learning Distributional Programs for Relational Autocompletion
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• A Comparison between Two Statistical Relational Models
• A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages
• Probabilistic description logic programs under inheritance with overriding for the semantic Web
• Probabilistic reasoning with answer sets
• Markov logic networks
• Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence
• Query answering DL-lite knowledge bases from hidden datasets
• Learning directed relational models with recursive dependencies
• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
• Combining probabilistic logic programming with the power of maximum entropy
• The complexity of Bayesian networks specified by propositional and relational languages
• On the complexity of propositional and relational credal networks
• Probabilistic logic with independence

Uses Software

• IDEAL

This page was built for publication: Answering queries from context-sensitive probabilistic knowledge bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673387)