APA (7th ed.) Citation

Kokkinis, I. (2018). The complexity of satisfiability in non-iterated and iterated probabilistic logics. Annals of mathematics and artificial intelligence, 83(3-4), 351-382. https://doi.org/10.1007/s10472-018-9593-y

Chicago Style (17th ed.) Citation

Kokkinis, Ioannis. "The Complexity of Satisfiability in Non-iterated and Iterated Probabilistic Logics." Annals of Mathematics and Artificial Intelligence 83, no. 3-4 (2018): 351-382. https://doi.org/10.1007/s10472-018-9593-y.

MLA (9th ed.) Citation

Kokkinis, Ioannis. "The Complexity of Satisfiability in Non-iterated and Iterated Probabilistic Logics." Annals of Mathematics and Artificial Intelligence, vol. 83, no. 3-4, 2018, pp. 351-382, https://doi.org/10.1007/s10472-018-9593-y.