From Propositional Logic to Plausible Reasoning: A Uniqueness Theorem

June 16, 2017 Β· Declared Dead Β· πŸ› International Journal of Approximate Reasoning

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kevin S. Van Horn arXiv ID 1706.05261 Category cs.AI: Artificial Intelligence Cross-listed cs.LO Citations 3 Venue International Journal of Approximate Reasoning Last Checked 4 months ago
Abstract
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be preserved in the extended logic; as such, the requirements are simpler and less problematic than those used in Cox's Theorem and its variants. As with Cox's Theorem, our requirements imply that the extended logic must be isomorphic to (finite-set) probability theory. We also obtain specific numerical values for the probabilities, recovering the classical definition of probability as a theorem, with truth assignments that satisfy the premise playing the role of the "possible cases."
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted