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

Ioannis Kokkinis

Published in: Ann. Math. Artif. Intell. (2018)

Keyphrases

computational complexity
bayesian networks
information theoretic
data driven
expressive power
decision procedures
database
worst case
np complete
nonmonotonic logics
reasoning problems