Theory and algorithms for analysing the consistent region in probabilistic logic

AbstractThis paper explores some topological features in order to analyse the consistent region in Probabilistic Logic. Using the L1 norm enables us to reduce and stabilize the consistent area associated with the probability of a predicate in a set of beliefs. The concept of facts and rules is approached as a particular problem. We present the program of the method used and propose an application to predicates in first-order logic. A study of the accuracy and the program complexity is made and compared to other methods