The complexity of satisfiability in non-iterated and iterated probabilistic logics-Reference-Cited by-同舟云学术

The complexity of satisfiability in non-iterated and iterated probabilistic logics

Published:2018-07-06 Issue:3-4 Volume:83 Page:351-382
ISSN:1012-2443
Container-title:Annals of Mathematics and Artificial Intelligence
language:en
Short-container-title:Ann Math Artif Intell

Author:

Kokkinis Ioannis^ORCID

Funder

Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

European Research Council

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Artificial Intelligence

Link

http://link.springer.com/article/10.1007/s10472-018-9593-y/fulltext.html

Reference33 articles.

1. Achilleos, A.: Nexp-completeness and universal hardness results for justification logic. In: Beklemishev L.D., Musatov D.V. (eds.) Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings, volume 9139 of Lecture Notes in Computer Science, pp. 27–52. Springer, Berlin (2015)

2. Artemov, S.N.: Operational modal logic. Technical Report MSI 95–29. Cornell University (1995)

3. Artemov, S.N.: Explicit provability and constructive semantics. Bull. Symb. Log. 7(1), 1–36 (2001)

4. Artemov, S., Fitting, M.: Justification logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, winter 2016 edition (2016)

5. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, New York (2001)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Probabilistic justification logic;Journal of Logic and Computation;2020-01

2. Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities;Journal of Logic, Language and Information;2019-09-03