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

• Published in: Annals of mathematics and artificial intelligence Vol. 83; no. 3-4; pp. 351 - 382
• Main Author: Kokkinis, Ioannis
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 01.08.2018; Springer; Springer Nature B.V
• Subjects: Artificial Intelligence; Complex Systems; Complexity; Computer Science; Counterfeit; Counterfeiting; Language; Logic; Mathematics; Operators (mathematics); Probability; Statistical analysis; Probabilistic logic; Justification logic; 03B70; Computational complexity; Satisfiability

Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example, in PL we can express a statement like “the probability of truthfulness of A is at leas...