Locally strong coherence in inferential processes

In this paper we deal with probabilistic inference in the most general form of coherent conditional probability assessments. In particular, our aim is to reduce computational difficulties that could arise with a direct application of the main characterization results. We reach our goal by introducing the notion of locally strong coherence and characterizing it by logical conditions. Hence, some of the numerical constraints are replaced by Boolean satisfiability conditions. An automatic procedure is proposed and its efficiency is proved. Some examples are reported to make easier the understanding of the machinery and to show its effectiveness.