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.

Simplification rules for the coherent probability assessment problem / M., Baioletti; A., Capotorti; S., Tulipani; Vantaggi, Barbara. - In: ANNALS OF MATHEMATICS AND OF ARTIFICIAL INTELLIGENCE. - ISSN 1012-2443. - STAMPA. - 35:1-4(2002), pp. 11-28. [10.1023/a:1014585822798]

Simplification rules for the coherent probability assessment problem

VANTAGGI, Barbara
2002

Abstract

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.
2002
coherent probability assessment; probabilistic satisfiability; simplification rules
01 Pubblicazione su rivista::01a Articolo in rivista
Simplification rules for the coherent probability assessment problem / M., Baioletti; A., Capotorti; S., Tulipani; Vantaggi, Barbara. - In: ANNALS OF MATHEMATICS AND OF ARTIFICIAL INTELLIGENCE. - ISSN 1012-2443. - STAMPA. - 35:1-4(2002), pp. 11-28. [10.1023/a:1014585822798]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/100231
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 22
  • ???jsp.display-item.citation.isi??? 20
social impact