Artificial Intelligence
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Some first-order probability logics
Theoretical Computer Science
Probabilistic Default Reasoning with Conditional Constraints
Annals of Mathematics and Artificial Intelligence
International Journal of Approximate Reasoning
Generalized qualitative probability: savage revisited
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
A branching time logic with two types of probability operators
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
A probabilistic temporal logic that can model reasoning about evidence
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
On real-valued evaluation of propositional formulas
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
A propositional probabilistic logic with discrete linear time for reasoning about evidence
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
The paper presents a sound and strongly complete axiomatization of reasoning about polynomial weight formulas. In addition, the PSPACE decision procedure for polynomial weight formulas developed by Fagin, Halpern and Megiddo works for our logic as well. The introduced formalism allows the expression of qualitative probability statements, conditional probability and Bayesian inference.