论文信息 - Computational Aspects of Probability Logics

Computational Aspects of Probability Logics

This paper gives an overview of recent results about the computational complexity of the problem of checking the coherence for a partial probability assessment. Moreover, a decision procedure which works directly on the Boolean relations by simplification rules and by elimination of Boolean variables is presented.

Sauro Tulipani | S. Tulipani

[1] George Boole,et al. An Investigation of the Laws of Thought: Frontmatter , 2009 .

[2] Ronald Fagin,et al. A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3] Andrea Capotorti,et al. Elimination of Boolean variables for probabilistic coherence , 2000, Soft Comput..

[4] Pierre Hansen,et al. Column Generation Methods for Probabilistic Logic , 1989, INFORMS J. Comput..

[5] Giangiacomo Gerla,et al. Inferences in Probability Logic , 1994, Artif. Intell..

[6] Giulianella Coletti,et al. Coherent Numerical and Ordinal Probabilistic Assessments , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[7] T. Hailperin,et al. Best Possible Inequalities for the Probability of a Logical Function of Events , 1965 .

[8] Nils J. Nilsson,et al. Probabilistic Logic * , 2022 .

[9] Christos H. Papadimitriou,et al. Probabilistic satisfiability , 1988, J. Complex..

[10] Nils J. Nilsson,et al. Probabilistic Logic Revisited , 1993, Artif. Intell..

[11] Jan Pavelka,et al. On Fuzzy Logic I Many-valued rules of inference , 1979, Math. Log. Q..

[12] Peter Haddawy,et al. Anytime Deduction for Probabilistic Logic , 1994, Artif. Intell..

[13] Pierre Hansen,et al. Boole's Conditions of Possible Experience and Reasoning under Uncertainty , 1992, Discret. Appl. Math..

[14] Angelo Gilio,et al. Probabilistic Consistency of Knowledge Bases in Inference Systems , 1993, ECSQARU.