scientific article; zbMATH DE number 4064538

From MaRDI portal
Publication:3798294





[For the entire collection see Zbl 0643.00027.] We present a formal semantics for rule-based systems with uncertainty (this field has also become known as ``quantitative logic programming). Unlike previous works, our framework is general enough to accommodate most of the known schemes of reasoning with uncertainty found in the existing expert systems. We provide a rigorous treatment of the issue of evidential independence, and study its impact on the semantics. To the best of our knowledge, this issue has not been addressed before in the literature on quantitative logic programming. In expert systems evidential independence received only an ad hoc treatment, while the approaches found in the theory of evidential reasoning are feasible only in small scale systems. We discuss the problem of query optimization and, as a first step, present a quantitative semi-naive query evaluation algorithm - generalization of a method well-known in deductive databases. Treatment of negation and conflicting evidence based on, so called, support logic is given in the last part of the paper, where we extend the semantics of stratified programs to deal with uncertainty.




Cited in
(28)








This page was built for publication:

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