Soft Computing manuscript No (original) (raw)

Abstract

In this paper we deal with the computational complexity problem of checking the coherence of a partial probability assessment (called CPA). The CPA problem, like its analogous PSAT, is NP-complete so we look for an heuristic procedure to make tractable reasonable instances of the problem. Starting from the characteristic feature of de Finetti's approach (i.e. the explicit distinction between the probabilistic assessment and the logical relations among the sentences) we introduce several rules for a sequential elimination" of Boolean variables from the domain of the assessment. The procedure resembles the well known Davis-Putnam rules for the satis ability, however we have, as a drawback, the introduction of constraints (among real variables) whose satis ability must be checked. In simple examples we test the eciency of the procedure respect to the raditional" approach of solving a linear system with a huge coecient matrix built from the atoms generated by the domain of...

Andrea Capotorti hasn't uploaded this paper.

Let Andrea know you want this paper to be uploaded.

Ask for this paper to be uploaded.