Answering queries from context-sensitive probabilistic knowledge bases

DOI10.1016/S0304-3975(96)00128-4MaRDI QIDQ673387zbMATH OpenFDO

Authors Liem Ngo, Peter Haddawy

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00128-4

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic reasoning with answer sets
• Reasoning with BKBs -- algorithms and complexity
• A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
• Logic Programming and Nonmonotonic Reasoning
• Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy

Cites work

• Bilattices and the semantics of logic programming
• scientific article; zbMATH DE number 4026795 (Why is no real title available?)
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Probabilistic Horn abduction and Bayesian networks
• Probabilistic Inference and Influence Diagrams
• Probabilistic logic programming
• Quantitative deduction and its fixpoint theory
• The computational complexity of probabilistic inference using Bayesian belief networks
• The well-founded semantics for general logic programs

Cited in

(27)

• Learning to assign degrees of belief in relational domains
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• The complexity of Bayesian networks specified by propositional and relational languages
• Learning directed relational models with recursive dependencies
• On the complexity of inference about probabilistic relational models
• Causal learning with Occam's razor
• Query answering DL-lite knowledge bases from hidden datasets
• The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
• P-log: refinement and a new coherency condition
• 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
• Markov logic networks
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• A Comparison between Two Statistical Relational Models
• Probabilistic reasoning with answer sets
• A survey of directed entity-relation-based first-order probabilistic languages
• On the complexity of propositional and relational credal networks
• Probabilistic Inductive Logic Programming
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Basic Principles of Learning Bayesian Logic Programs
• Learning Distributional Programs for Relational Autocompletion
• Languages for probabilistic modeling over structured and relational domains
• Combining probabilistic logic programming with the power of maximum entropy
• Mixed deterministic and probabilistic networks

Describes a project that uses

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)