Maximum Entropy in Nilsson's Probabilistic Logic

Kane, Thomas B.

Maximum Entropy in Nilsson's Probabilistic Logic

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 452-456.

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.

Thomas B. Kane. 1989. Maximum Entropy in Nilsson's Probabilistic Logic. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 452–456. https://ijcai.org/proceedings/1989/73

@inproceedings{ijcai1989p73,
  title     = {Maximum Entropy in Nilsson's Probabilistic Logic},
  author    = {Kane, Thomas B.},
  booktitle = {Proceedings of the Eleventh International Joint Conference on
               Artificial Intelligence, {IJCAI-89}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {N. S. Sridharan},
  pages     = {452--456},
  year      = {1989},
  month     = {8},
  note      = {Automated Deduction},
  url       = {https://ijcai.org/proceedings/1989/73},
}

TY  - CPAPER
TI  - Maximum Entropy in Nilsson's Probabilistic Logic
AU  - Kane, Thomas B.
T2  - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1989
SP  - 452
EP  - 456
UR  - https://ijcai.org/proceedings/1989/73
ER  -