The Complexity of Non-Iterated Probabilistic Justification Logic-Reference-Cited by-同舟云学术

The Complexity of Non-Iterated Probabilistic Justification Logic

Published:2016 Issue: Volume: Page:292-310
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kokkinis Ioannis

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-30024-5_16

Reference24 articles.

1. Achilleos, A.: Nexp-completeness and universal hardness results for justification logic, cSR 2015, pp. 27–52 (2015)

2. Artemov, S.N.: Operational modal logic. Technical report, MSI 95–29, Cornell University, December 1995

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

4. Artemov, S.N.: The ontology of justifications in the logical setting. Studia Logica 100(1–2), 17–30 (2012). Published online, February 2012

5. Artemov, S.N., Fitting, M.: Justification logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Fall 2012 edn. (2012). http://plato.stanford.edu/archives/fall2012/entries/logic-justification/

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

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

2. Justification Logic with Confidence;Studia Logica;2019-08-21

3. The complexity of satisfiability in non-iterated and iterated probabilistic logics;Annals of Mathematics and Artificial Intelligence;2018-07-06

4. Justification Logic with Approximate Conditional Probabilities;Logic, Rationality, and Interaction;2017

5. The Complexity of Non-Iterated Probabilistic Justification Logic;Lecture Notes in Computer Science;2016