{"type":"ScholarlyArticle","title":"Maximum Entropy in Nilsson's Probabilistic Logic","authors":[{"name":"Thomas B. Kane","slug":"thomas-b-kane","given":"Thomas B.","family":"Kane","affiliation":""}],"abstract":"Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the framework, which allows the expert to include conditional probabilities in the semantic tree, thus making Probabilistic Logic more expressive. An algorithm is presented which will find the maximum entropy point probability for a rule of entailment without resorting to solution by iterative approximation. The algorithm works for both the propositional and the predicate logic. Also presented are a number of methods for employing the conditional probabilities.","doi":null,"url":"https://ijcai.org/proceedings/1989/73","pdf":"https://ijcai.org/proceedings/1989/0073.pdf","markdown":"https://ijcai.org/proceedings/1989/73.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/73","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Deduction","track":"Automated Deduction","number":73,"pages":{"first":452,"last":456},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}