A propositional probabilistic logic with discrete linear time for reasoning about evidence

Authors:
Zoran Ognjanović;Zoran Marković;Miodrag Rašković;Dragan Doder;Aleksandar Perović
Affiliations:
Mathematical Institute of Serbian Academy of Sciences and Arts, Belgrade, Serbia 11000;Mathematical Institute of Serbian Academy of Sciences and Arts, Belgrade, Serbia 11000;Mathematical Institute of Serbian Academy of Sciences and Arts, Belgrade, Serbia 11000;University of Belgrade, Faculty of Mechanical Engineering, Belgrade, Serbia 11120;University of Belgrade, Faculty of Transportation and Traffic Engineering, Belgrade, Serbia 11000
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2012

Citing 20
Cited 0

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Probabilistic logic

Artificial Intelligence
The power of temporal proofs

Theoretical Computer Science
The power of temporal proofs (corrigendum)

Theoretical Computer Science
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
On the strength of temporal proofs

MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Two views of belief: belief as generalized probability and belief as evidence

Artificial Intelligence
Modal and temporal logics

Handbook of logic in computer science (vol. 2)
Temporal logic (vol. 1): mathematical foundations and computational aspects

Temporal logic (vol. 1): mathematical foundations and computational aspects
Automated temporal reasoning about reactive systems

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Axiomatising Extended Computation Tree Logic

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Reasoning about Uncertainty

Reasoning about Uncertainty
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity

Journal of Logic and Computation
A logic with approximate conditional probabilities that can model default reasoning

International Journal of Approximate Reasoning
A logic for reasoning about evidence

Journal of Artificial Intelligence Research
A probabilistic logic with polynomial weight formulas

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of the paper is to present a sound, strongly complete and decidable probabilistic temporal logic that can model reasoning about evidence. The formal system developed here is actually a solution of a problem proposed by Halpern and Pucella (J Artif Intell Res 26:1---34, 2006).