Simplification Rules for the Coherent Probability Assessment Problem

In this paper we develop a procedure for checking the consistency (coherence) of a partial probability assessment. The general problem (called CPA) is NP-complete, hence, to have a reasonable application some heuristic is needed. Our proposal differs from others because it is based on a skilful use...

Full description

Saved in:
Bibliographic Details
Published in:Annals of mathematics and artificial intelligence 2002-05, Vol.35 (1-4), p.11-28
Main Authors: Baioletti, Marco, Capotorti, Andrea, Tulipani, Sauro, Vantaggi, Barbara
Format: Article
Language:English
Subjects:
Consistency
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we develop a procedure for checking the consistency (coherence) of a partial probability assessment. The general problem (called CPA) is NP-complete, hence, to have a reasonable application some heuristic is needed. Our proposal differs from others because it is based on a skilful use of the logical relations present among the events. In other approaches the consistency problem is reduced directly to the satisfiability of a system of linear constraints. Here, thanks to the characterization of particular configurations and to the elimination of variables, an instance of the problem is reduced to smaller instances. To obtain such results, we introduce a procedure based on rules resembling those given by Davis–Putnam for the satisfiability of Boolean formulas. At the end a particularized description of an actual implementation is given.
ISSN:1012-2443
1573-7470
DOI:10.1023/A:1014585822798