Correctness criteria of some algorithms for uncertain reasoning using incidence calculus
Incidence calculus is a technique for associating uncertainty values with logical sentences. These uncertainty values are called incidences and they are sets of points, which may be thought of as representing equivalence classes of situations, Tarskian models, or possible worlds. Incidence calculus was originally introduced by the author [(*)\ ibid. 1, 263-283 (1985; Zbl 0615.68067)]. Incidence calculus was designed to overcome various inherent problems with purely numeric mechanisms for uncertain reasoning. In particular, incidences can represent the dependence between sentences, which numbers cannot, and hence incidence calculus can provide genuine, probabilistic reasoning. In this paper we prove soundness and completeness results for some algorithms introduced in (*) and hence satisfy some of the correctness criteria for incidence calculus. These algorithms can be used for probabilistic reasoning and to check the consistency of the subjective probabilities of sentences.
probabilistic logic with truth functional connectives
scientific article; zbMATH DE number 4047206