Liên hệ giữa nguyên lý entropy cực đại và giả thiết độc lập có điều kiện trong logic xác suất
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/15/3/7777Abstract
In the Probabilistic Logic, the single value of the truth probability of a sentence is calculated by adding some assumptions. By adding the Maximum Entropy Principle (MEP) the reasoning problem becomes a nonlinear optimization problem. In this note we assert the equivalence between the MEP and the Conditional Independence Assumption (CIA) and Randomness Assumption (RA) formulas for a class of Probabilistic Knowledge Base. Then instead of solving a nonlinear optimization problem to find the truth probability of a sentence, we can derive it from Calculua C and some CIA + RA formulas.
Metrics
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.