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

Zoran Ognjanovic. Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity. Journal of Logic and Computation, 16(2):257-285, 2006. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.