Answering Queries from Context-Sensitive Probabilistic Knowledge Bases

Abstract

We deene a language for representing context-sensitive probabilistic knowledge. A knowledge base consists of a set of universally quantiied probability sentences that include context constraints, which allow inference to be focused on only the relevant portions of the probabilistic knowledge. We provide a declarative semantics for our language. We present a query answering procedure which takes a query Q and a set of evidence E and constructs a Bayesian network to compute P(QjE). The posterior probability is then computed using any of a number of Bayesian network inference algorithms. We use the declarative semantics to prove the query procedure sound and complete. We use concepts from logic programming to justify our approach. Submitted to Theoretical Computer Science special issue on Uncertainty in Databases and Deductive Systems.

DOI: 10.1016/S0304-3975(96)00128-4

Extracted Key Phrases

Statistics

01020'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

222 Citations

Semantic Scholar estimates that this publication has 222 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Ngo1997AnsweringQF, title={Answering Queries from Context-Sensitive Probabilistic Knowledge Bases}, author={Liem Ngo and Peter Haddawy}, journal={Theor. Comput. Sci.}, year={1997}, volume={171}, pages={147-177} }