An investigation of the general solution to entailment in probabilistic logic

✍ Scribed by Mary Deutsch-McLeish

• Publisher: John Wiley and Sons
• Year: 1990
• Tongue: English
• Weight: 503 KB
• Volume: 5
• Category: Article
• ISSN: 0884-8173
• DOI: 10.1002/int.4550050503

✦ Synopsis

Probabilistic Logic was first proposed by Nils Nilsson as a mechanism for reasoning with uncertain knowledge. When applying this method bounds are obtained on entailment values. In order to obtain precise values, Nilsson suggests two methodologies, one involving an application of maximum entropy and one using an approximation obtained by applying a subspace projection. This article provides conditions under which these solutions will be the same. The question of entailment is re-examined providing the complete family of solutions. Examples are discussed and some comments are made concerning the use and computational problems of probabilistic logic.