Decidability and Undecidability in Probability Logic

We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas is undecidable.

• Type: Conference
• Year: 2009
• Where: LFCS
• Authors: Sebastiaan Terwijn
• Keywords: Artificial Intelligence, Computational Aspects, LFCS 2009, Paraconsistent Logic, Probabilistic Logic