A note on the infeasibility of some inference processes

DOI10.1002/INT.4550050509MaRDI QIDQ5748884zbMATH OpenOpenAlexFDO

Authors Ian Maung, Jeff Paris

Publication date 1990

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.4550050509

zbMATH Keywords

constraintsdegree of belief

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the hardness of approximate reasoning
• Probabilistic satisfiability
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• scientific article; zbMATH DE number 4130346
• A linear programming approach to reasoning about probabilities

Cites work

• Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Uniform Convergence in Probability and Stochastic Equicontinuity

Cited in

(10)

• A model of belief
• Two characterizations of a minimum-information principle for possibilistic reasoning
• A note on measures of fuzziness applied to nonmonotonic fuzzy propositional logic
• On the hardness of approximate reasoning
• Objective Bayesian Nets for Integrating Consistent Datasets
• INDEPENDENCE IN COMPLETE AND INCOMPLETE CAUSAL NETWORKS UNDER MAXIMUM ENTROPY
• Special issue: Soft computing in recognition and search
• A methodology for computing with words
• An inference engine for propositional two-valued logic based on the radical membership problem
• Discovering maximum entropy knowledge

This page was built for publication: A note on the infeasibility of some inference processes

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