Premium
An investigation of the general solution to entailment in probabilistic logic
Author(s) -
DeutschMcLeish Mary
Publication year - 1990
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550050503
Subject(s) - logical consequence , probabilistic logic , subspace topology , computer science , projection (relational algebra) , artificial intelligence , entropy (arrow of time) , theoretical computer science , mathematics , algorithm , physics , quantum mechanics
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.