Edinburgh Research Explorer

Assignment Methods for Incidence Calculus

Research output: Contribution to journalArticlepeer-review

Related Edinburgh Organisations

Open Access permissions



Original languageEnglish
Pages (from-to)21–41
JournalInternational Journal of Approximate Reasoning
Issue number1
Publication statusPublished - 1995


IIncidence calculus is a mechanism for probabilistic reasoning in which sets of possible worlds, called incidences, are associated with axioms, and probabilities are then associated with these sets. Inference rules are used to deduce bounds on the incidence of formulae which are not axioms, and bounds for the probability of such a formula can then be obtained. In practice an assignment of probabilities directly to axioms may be given, and it is then necessary to find an assignment of incidence which will reproduce these probabilities. We show that this task of assigning incidences can be viewed as a tree searching problem, and two techniques for performing this research are discussed. One of these is a new proposal involving a depth first search, while the other incorporates a random element. A Prolog implementation of these methods has been developed. The two approaches are compared for efficiency and the significance of their results are discussed. Finally we discuss a new proposal for applying techniques from linear programming to incidence calculus.

    Research areas

  • Incidence calculus, probabilistic reasoning, incidence assignment, linear programming

Download statistics

No data available

ID: 400979